Is VC NP-hard or NP-complete?
http://tau-cm2012.wikidot.com/forum/t-513716/is-vc-np-hard-or-np-complete
Posts in the discussion thread "Is VC NP-hard or NP-complete?"Mon, 17 Jun 2019 09:15:48 +0000http://tau-cm2012.wikidot.com/forum/t-513716#post-1493755(no title)
http://tau-cm2012.wikidot.com/forum/t-513716/is-vc-np-hard-or-np-complete#post-1493755
Fri, 29 Jun 2012 06:23:41 +0000Netanel
VC is NPC. In the recitation, Ori mentioned that it is NP-hard because that was the main issue in showing WVC is NP-hard (reduction from every language in NP). Every NPC is also NP-hard by definition. And we've showed a two-way reduction between VC and Independent Set, implying that VC is NPC (+ the verifier you wrote).
]]>
http://tau-cm2012.wikidot.com/forum/t-513716#post-1493353Is VC NP-hard or NP-complete?
http://tau-cm2012.wikidot.com/forum/t-513716/is-vc-np-hard-or-np-complete#post-1493353
Thu, 28 Jun 2012 20:49:39 +0000david
In one of the recitations we said that VC is NP-hard (we used that fact to show that WVC is NP-hard). But isn't VC actually NP-complete? I mean - why isn't VC in NP? A polynomial verifier for VC will get a set of vertices C of size k (as the witness) and check whether those vertices touch all the edges of the graph.