🎙 Free live masterclass · Sun, 29 Nov, 7:00 pm IST · Java Full Stack roadmap Register free →
Skills101
← 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?

  1. A.Non-polynomial
  2. B.Nondeterministic polynomial time — solutions can be verified in polynomial time
  3. C.Not provable
  4. 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 →