Question

Which statement accurately describes an NP-complete problem?

A An NP-complete problem is any problem that can be solved in polynomial time.
B An NP-complete problem is a problem that is both in NP and NP-hard.
C An NP-complete problem can only be solved using exponential time algorithms.
D An NP-complete problem is a problem that can be verified in logarithmic time.
E None of these
Practice Next

Relevant for Exams:

Hey! Ask a query