A problem in NP is NP-complete if

PYQ GATE 2006

A problem in NP is NP-complete if  

  1. A.

    It can be reduced to the 3-SAT problem in polynomial time

  2. B.

    The 3-SAT problem can be reduced to it in polynomial time

  3. C.

    It can be reduced to any other problem in NP in polynomial time

  4. D.

    Some problem in NP can be reduced to it in polynomial time

Attempted by 113 students.

Sign up free to check your answer

Sign up free

Explore the full course: Zero To Hero

Loading lesson…