Catalog · Algorithmic Lower Bounds: Fun with Hardness Proofs Lecture 20 of 23 Lecture 20: Undecidable and P-Complete ← Previous Lecture 19: Unbounded Games Next → Lecture 21: 3SUM and APSP Hardness ✓ Mark complete Materials Transcript (PDF) ↗ transcript