Intermediate
Theory of Computation
Q52 / 100
What is the complexity class NP?
Correct! Well done.
Incorrect.
The correct answer is B) Problems whose solutions can be verified in polynomial time by a deterministic TM (or solved in polynomial time by an NTM)
B
Correct Answer
Problems whose solutions can be verified in polynomial time by a deterministic TM (or solved in polynomial time by an NTM)
Explanation
NP is the class of problems with polynomial-time verifiable solutions (witnesses/certificates). Equivalently, solvable by a nondeterministic TM in polynomial time.
Progress
52/100