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

The Class NP (Nondeterministic Polynomial)

Defining NP as problems whose solutions can be verified in polynomial time, introducing the verifier perspective.

This lesson is for subscribers

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