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$?
正しい解決策はありません