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