Lectures

For some lectures we will follow Lectures in Computational Complexity of Jin-Yi Cai (LC below), the book Computational Complexity: A Modern Approach of Sanjeev Arora and Boaz Barak (MA below), and the book Communication Complexity of Anup Rao and Amir Yehudayoff (CC below). TC denotes the Sipser book.

Date

Topic

Readings

Homework

Sep 3Review of Turing machines; Hierarchy theorems.Sections 3.1 and 9.1 of TC
Sep 8Polynomial hierarchy.Section 2.3 of LC
Sep 10Oracle Turing machines; Σ2P = NPSATSections 2.4 and 2.5 of LC
Sep 15Circuits and sparse sets; Karp–Lipton theoremSections 4.1 and 4.2 of LC
Sep 17Mahaney's theorem; PSPACESection 4.3 of LC and Section 8.1 of TC
Sep 22PSPACE = NPSPACESec 8.1 and 8.2 of TC
Sep 24L, NL and coNLSec 8.4 and 8.6 of TC
Sep 29NL = co-NL and PSPACE-completenessSec 8.6 and 8.3 of TC
Oct 1NL-completeness and randomized algorithmsSec 8.5 of TC and 5.2.2 of LC
Oct 6Amplification of RP and BPP with tail boundsSec 5.1.1, 5.1.2, 5.1.3 and 5.4 of LC
Oct 8BPP in Σ2P and Interactive Proof SystemsSec 5.5 of LC
Oct 13#SAT in IPSec 10.4 of TC
Oct 15IP = PSPACESec 10.4 of TC
Oct 20Midterm
Oct 22PCP TheoremSec 18.1 of MA
Oct 27PCP TheoremSec 18.2 of MA
Oct 29PCP TheoremSec 18.4 of MA
Nov 3Academic Holiday
Nov 5PCP TheoremSec 18.4 of MA
Nov 10Communication complexityChapter 1 of CC
Nov 12Lower bounds via monochromatic rectanglesChapter 1 of CC
Nov 17CC vs monochromatic partitions; rankChapter 1 and Pages 33-37 of CC
Nov 19Randomized communication complexitySec 2.1, 2.2 and 2.4 of Notes by Shachar Lovett
Nov 24Academic Holiday
Nov 26Lower bounds for disjointnessSec 4.3 of Notes by Shachar Lovett
Dec 1Circuit depth and KW gamesPages 97-99 of CC
Dec 3Monotone circuit depth lower boundsPages 99-101 of CC
Dec 8TBA