Question

Which of the following statements is true regarding the class NP?

A Problems in NP can be solved in polynomial time on deterministic Turing machines.
B Problems in NP are typically harder to solve than problems in P.
C Problems in NP can be verified in polynomial time on non-deterministic Turing machines.
D Problems in NP can be solved using brute-force algorithms.
E None of these
Practice Next

Relevant for Exams:

Hey! Ask a query