6.890 Algorithmic Lower Bounds: Fun with Hardness Proofs
6.890 Algorithmic Lower Bounds: Fun with Hardness Proofs (Fall 2014, MIT OCW). Instructor: Professor Erik Demaine. 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 assumptions like P ≠ NP). The class focuses on reductions and techniques for proving problems are computationally hard for a variety of complexity classes. Along the way, the class will create many interesting gadgets, learn many hardness proof styles, explore the connection between games and computation, survey several important problems and complexity classes, and crush hopes and dreams (for fast optimal solutions). (from ocw.mit.edu)
| Lecture 07 - Planar SAT |
Instructor: Erik Demaine. In this lecture, Professor Demaine introduces planar versions of 3SAT, proving these versions are NP-hard.
Go to the Course Home or watch other lectures: