in Algorithms retagged by
4,680 views
5 votes
5 votes

A problem in NP is NP-complete if

  1. it can be reduced to the 3-SAT problem in polynomial time
  2. the 3-SAT problem can be reduced to it in polynomial time
  3. it can be reduced to any other problem in NP in polynomial time
  4. some problem in NP can be reduced to it in polynomial time
in Algorithms retagged by
4.7k views

1 Answer

12 votes
12 votes
Best answer

(B) A problem in NP becomes NPC if all NP problems can be reduced to it in polynomial time. This is same as reducing any of the NPC problem to it. 3-SAT being an NPC problem, reducing it to a NP problem would mean that NP problem is NPC.

http://gatecse.in/wiki/NP,_NP_Complete,_NP_Hard

selected by
by

2 Comments

@Arjun sir.. have a look at option (D)... this is also correct..

(Some problem in NP) <= (the given problem, which is known to be NP)..
0
0
No. For D to be correct "some problem in NP" has to be replaced by "all problems in NP".
9
9
Answer:

Related questions