Catalog · Design and Analysis of Algorithms Lecture 16 of 34 Lecture 16: Complexity: P, NP, NP-completeness, Reductions ← Previous Lecture 15: Linear Programming: LP, reductions, Simplex Next → Lecture 17: Complexity: Approximation Algorithms ✓ Mark complete Materials Transcript (PDF) ↗ transcript