Catalog · Theory of Computation Lecture 13 of 25 Lecture 14: P and NP, SAT, Poly-Time Reducibility ← Previous Lecture 12: Time Complexity Next → Lecture 15: NP-Completeness ✓ Mark complete Materials Transcript (PDF) ↗ transcript