A problem in NP is NP-complete if
GATE · 2006 · IT
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
Attempted by 86 students.
Sign up free to check your answer
Sign up freeLoading lesson…