← Quiz: Decidability and Complexity: all 10 questions
Quiz: Decidability and Complexity · Question 2 of 10
What does "NP" stand for?
What does "NP" stand for?
- A.Non-polynomial
- B.Nondeterministic polynomial time — solutions can be verified in polynomial time
- C.Not provable
- D.New problems
Answer & explanation
Correct answer: Nondeterministic polynomial time — solutions can be verified in polynomial time
NP problems have polynomial-time verifiers (or are solvable by a nondeterministic TM in polynomial time).
Can you get the rest right without peeking?
Take the timed Quiz: Decidability and Complexity quiz free. Pass it to earn XP and count towards your certificate.
Start the quiz →