GATE | GATE IT 2006 | Question 10
A problem in NP is NP-complete if
It can be reduced to the 3-SAT problem in polynomial time
The 3-SAT problem can be reduced to it in polynomial time
It can be reduced to any other problem in NP in polynomial time
Some problem in NP can be reduced to it in polynomial time
A problem in NP becomes NPC if all NP problems can be reduced to it in polynomial time. This is the same as reducing any of the NPC problems to it. 3-SAT being an NPC problem, reducing it to an NP problem would mean that NP problem is NPC.
Please refer: http://www.geeksforgeeks.org/np-completeness-set-1/
Quiz of this Question
Please comment below if you find anything wrong in the above post
Level Up Your GATE Prep!
Embark on a transformative journey towards GATE success by choosing Data Science & AI
as your second paper choice with our specialized course. If you find yourself lost in the vast landscape of the GATE syllabus, our program is the compass you need.