Vertex Cover of size at most $\log n$
-
05-11-2019 - |
Question
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$?
No correct solution
Licensed under: CC-BY-SA with attribution
Not affiliated with cs.stackexchange