retagged by
6,008 views
6 votes
6 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
retagged by

1 Answer

Best answer
12 votes
12 votes

(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
Answer:

Related questions

10 votes
10 votes
3 answers
2
Ishrat Jahan asked Oct 27, 2014
7,047 views
For problems X and Y, Y is NP-complete and X reduces to Y in polynomial time. Which of the following is TRUE?If X can be solved in polynomial time, then so can YX is NP-c...
13 votes
13 votes
5 answers
4