GATE | GATE IT 2006 | Question 10
A problem in NP is NP-complete if
(A) It can be reduced to the 3-SAT problem in polynomial time
(B) The 3-SAT problem can be reduced to it in polynomial time
(C) It can be reduced to any other problem in NP in polynomial time
(D) some problem in NP can be reduced to it in polynomial time
Explanation: 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.
Attention reader! Don’t stop learning now. Practice GATE exam well before the actual exam with the subject-wise and overall quizzes available in GATE Test Series Course.
Learn all GATE CS concepts with Free Live Classes on our youtube channel.
Please refer: https://www.geeksforgeeks.org/np-completeness-set-1/
Quiz of this Question
Please comment below if you find anything wrong in the above post