Algorithmic Lower Bounds: Fun with Hardness Proofs free videos and free material uploaded by Massachusetts Institute of Technology. This session contains about Algorithmic Lower Bounds: Fun with Hardness Proofs Updated syllabus , Lecture notes , videos , MCQ , Privious Question papers and Toppers Training Provided Training of this course. If Material not uploaded check another subject
Introduction
3-partition I
3-partition II, 2–partition
SAT (Satisfiability)
SAT Reductions
Circuit SAT
Planar SAT
Hamiltonicity
Graph Problems
Inapproximability Introduction
Inapproximability Examples
Gap Inapproximability
Parameterized Complexity I: W Hierarchy
Parameterized Complexity II: ETH & Planar
P and ASP
NP & PSPACE Video Games
Nondeterministic Constraint Logic
0- and 2–player Games
More Games
Undecidability & P-completeness
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).
- 0 Reviews
- 1 Students
- 179 Courses
Write a public review