Catalog · Algorithmic Lower Bounds: Fun with Hardness Proofs Lecture 18 of 23 Lecture 18: 0- and 2-Player Games ← Previous Lecture 17: Nondeterministic Constraint Logic Next → Lecture 19: Unbounded Games ✓ Mark complete Materials Transcript (PDF) ↗ transcript