Algorithmic Lower Bounds: Fun with Hardness Proofs

6.890 Algorithmic Lower Bounds: Fun with Hardness Proofs is a class taking a practical approach to proving problems can't be solved efficiently (in polynomial time and assuming standard complexity-theoretic…

Lectures