Open In App

GATE | GATE IT 2006 | Question 10

Like Article
Like
Save
Share
Report

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


Answer: (B)

Explanation:

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


Last Updated : 28 Jun, 2021
Like Article
Save Article
Previous
Next
Share your thoughts in the comments
Similar Reads