Home » Courses » Electrical Engineering and Computer Science » Algorithmic Lower Bounds: Fun with Hardness Proofs » Lecture Videos
Lecture 1: Overview
Lecture 2: 3-Partition I
Lecture 3: 3-Partition II
Lecture 4: SAT I
Lecture 5: SAT Reductions
Lecture 6: Circuit SAT
Lecture 7: Planar SAT
Lecture 8: Hamiltonicity
Lecture 9: Graph Problems
Lecture 10: Inapproximabililty Overview
Lecture 11: Inapproximability Examples
Lecture 12: Gaps and PCP
Lecture 13: W Hierarchy
Lecture 14: ETH and Planar FPT
Lecture 15: #P and ASP
Lecture 16: NP and PSPACE Video Games
Lecture 17: Nondeterministic Constraint Logic
Lecture 18: 0- and 2-Player Games
Lecture 19: Unbounded Games
Lecture 20: Undecidable and P-Complete
Lecture 21: 3SUM and APSP Hardness
Lecture 22: PPAD
Lecture 23: PPAD Reductions