The previous lecture in this series is here. The next lecture in this series is here.
Quickly reviewed last lecture. Covered NP-completeness; SAT and 3SAT; and more. Discussed a strategy for proving NP-completeness with a reduction from 3SAT by constructing gadgets that simulate variables and clauses.
These videos are of a lecture course by Michael Sipser at the Massachusetts Institute of Technology in 2020, and made available as part of its OpenCourseWare initiative.