GATE 2006-IT
April 6, 2025GATE 2006-IT
April 6, 2025GATE 2006-IT
| 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
|
Question 10 Explanation:
A problem is in NP becomes NP-complete if all NP problems can be reduced to it in polynomial time. This is same as reducing any of the NPC problem to it. 3SAT being an NPC problem reducing it to a NP problem would mean that NP problem is NPC.
Correct Answer: B
Question 10 Explanation:
A problem is in NP becomes NP-complete if all NP problems can be reduced to it in polynomial time. This is same as reducing any of the NPC problem to it. 3SAT being an NPC problem reducing it to a NP problem would mean that NP problem is NPC.