Name: Lecture 16: Cook-Levin Theorem
Uploaded: 2021-10-06T12:44:33Z
Duration: 1 h 18 min 27 s
Description: Description: Quickly reviewed last lecture. Proved Cook-Levin Theorem: \(SAT\) is NP-complete. Also proved \(3SAT\) is NP-complete. Instructor: Prof. Michael Sipser

1:18:27

Description: Quickly reviewed last lecture. Proved Cook-Levin Theorem: \(SAT\) is NP-complete. Also proved \(3SAT\) is NP-complete.

Instructor: Prof. Michael Sipser