Vertex Cover of size at most $\log n$
-
05-11-2019 - |
Pergunta
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$?
Nenhuma solução correta
Licenciado em: CC-BY-SA com atribuição
Não afiliado a cs.stackexchange