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 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).
Starts : 2014-09-01
-- no reviews yet -- make the first review
If you know any alternatives, please let us know.
If you can suggest any prerequisite, please let us know.
If your company does certification for those who completed this course then register your company as certification vendor and add your exams to the Exams Directory.
Courses related to the course subject
Let us know when you did the course Algorithmic Lower Bounds: Fun with Hardness Proofs.
Add the course Algorithmic Lower Bounds: Fun with Hardness Proofs to My Personal Education Path.
Successfully added to your path.View your path
Select what exam to connect to the course. The course will be displayed on the exam page in the list of courses supported for certification with the exam.