Lecture 27 covers the major theorems of NP-completeness, P = NP question, and how to prove a new problem in NP-complete.
See All 30 Episodes of "Algorithm Design and Analysis"