Free MIT Course: Computational Complexity and Algorithmic Lower Bounds
Study the limits of efficient computation through reductions, satisfiability and hardness of approximation. MIT lectures connect formal complexity classes with examples of difficult algorithmic problems.










