Vertex Cover of size at most $\log n$

cs.stackexchange https://cs.stackexchange.com/questions/108507

  •  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$?

没有正确的解决方案

许可以下： CC-BY-SA 和 归因
不隶属于 cs.stackexchange
scroll top