Home » Course Layouts » Free Course Layout Udemy
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).
0
1
English
English [CC]
FREE
- Learn basic syntax that can apply to any language.
- Learn what is a programming language and the basic concepts for beginners.
- Understand what is Javascript in it's truest form.
- Know the basic syntax of Javascript.
- Know some hidden quirks in Javascript.
Description
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).
Course content
- Overview Unlimited
- 3 Partition 1 Unlimited
- 3 Partiotion 2 Unlimited
- SAT 1 Unlimited
- SAT Reductions Unlimited
- Circuit SAT Unlimited
- Planar SAT Unlimited
- Hamiltonicity Unlimited
- Graph Problems Unlimited
- Inapproximabililty Overview Unlimited
- Inapproximability Examples Unlimited
- Gaps and PCP Unlimited
- W Hierarchy Unlimited
- ETH and Planar FPT Unlimited
- #P and ASP Unlimited
- NP and PSPACE Video Games Unlimited
- Nondeterministic Constraint Logic Unlimited
- 0 and 2 Player Games Unlimited
- Unbounded Games Unlimited
- Undecidable and p-Complete Unlimited
- 3SUM And APSP Hardness Unlimited
- PPAD Unlimited
- PPAD Reduction Unlimited
Instructor
Massachusetts Institute of Technology
5
5
1
1916
1520
