Vertex Cover of size at most $\log n$
-
05-11-2019 - |
Вопрос
Consider the following language: $$ L = \{ G | G \text{ has a VC of size at most } \log n \} $$
Does $L\in P$ or $L\in NPC$?
Нет правильного решения
Не связан с cs.stackexchange
Вопрос
Consider the following language: $$ L = \{ G | G \text{ has a VC of size at most } \log n \} $$
Does $L\in P$ or $L\in NPC$?
Нет правильного решения