Course contentsShow
Computer Science
Lesson 1902 of 2,87243. Complexity TheoryPro lesson

The Class NP: Nondeterministic Polynomial Time

Define NP as problems with solutions verifiable in polynomial time by a deterministic algorithm.

This lesson is for subscribers

You've completed the free preview. Subscribe to unlock every lesson in every course.