Intermediate
Theory of Computation
Q53 / 100
What is an NP-complete problem?
Correct! Well done.
Incorrect.
The correct answer is B) A problem in NP to which every NP problem can be reduced in polynomial time (NP-hard + in NP)
B
Correct Answer
A problem in NP to which every NP problem can be reduced in polynomial time (NP-hard + in NP)
Explanation
NP-complete problems are the hardest in NP. If any NP-complete problem is in P, then P = NP. Examples: SAT, 3-SAT, Vertex Cover, Hamiltonian Path.
Progress
53/100