18.404J/6.840J The Theory of Computation(Fall 2020, MIT OCW). Instructor: Prof. Michael Sipser. This course emphasizes computability and computational complexity theory. Topics include regular and context-free languages, decidable and undecidable problems, reducibility, recursive function theory, time and space measures on computation, completeness, hierarchy theorems, inherently complex problems, oracles, probabilistic computation, and interactive proof systems.
(from ocw.mit.edu)
Lecture 14 - P and NP, SAT, Poly-Time Reducibility
Quickly reviewed last lecture. Defined NTIME (t(n)) complexity classes and the class NP. showed COMPOSITES ∈ NP. Discussed the P versus NP question. Proved ACFG ∈ P. Introduced the satisfiability problem SAT and polynomial-time reducibility.