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

The P vs NP Question

Formulate the central open question: does P equal NP, or are some verifiable problems inherently hard?

This lesson is for subscribers

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