| SESS # | TOPICS | KEY DATES |
|---|---|---|
| 1 | Introduction | |
| 2 | 3-partition I | Problem Set 1 Out |
| 3 | 3-partition II, 2–partition | |
| 4 | SAT (Satisfiability) | |
| 5 | SAT Reductions | |
| 6 | Circuit SAT |
Problem Set 1 Due one day before Session 6, Problem Set 2 Out |
| 7 | Planar SAT | |
| 8 | Hamiltonicity | Project Proposal Out |
| 9 | Graph Problems | |
| 10 | Inapproximability Introduction | Problem Set 2 Due one day after Session 10 |
| 11 | Inapproximability Examples | Problem Set 3 Out one day after Session 11 |
| 12 | Gap Inapproximability | |
| 13 | Parameterized Complexity I: W Hierarchy | |
| 14 | Parameterized Complexity II: ETH & Planar | Problem Set 3 Due one day after Session 14 |
| 15 | P and ASP | |
| 16 | NP & PSPACE Video Games | Project Proposal Due one day after Session 16 |
| 17 | Nondeterministic Constraint Logic | Problem Set 4 Out one day after Session 17 |
| 18 | 0- and 2–player Games | |
| 19 | More Games | |
| 20 | Undecidability & P-completeness | Problem Set 4 Due one day before Session 20 |
| 21 | 3SUM & APSP | |
| 22 | PPAD (guest lecture by Constantinos Daskalakis) | |
| 23 | PPAD Reductions (guest lecture by Constantinos Daskalakis) | Project Paper Due |