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

Cook-Levin Theorem

Understanding the proof that SAT is NP-complete, establishing the first known NP-complete problem.

This lesson is for subscribers

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