Tentative Schedule
Tu: Aug 25 — Intro: Concerns of the Course
Reading: AroraBarak: 0.1-0.3, 1.5 & Sipser: 4.2
Th: Aug 27 — Computational Model: The Turing Machine
Reading: AroraBarak: 1.1-1.5 & Sipser: 3.1,3.3
Tu: Sep 1 — The Time Hierarchy Theorem
Reading: AroraBarak: 1.4, 3.1 & Sipser: 9.1
Th: Sep 3 — The Extended Church-Turing Thesis and Nondeterminism
Reading: AroraBarak: 1.1-1.5 & Sipser: 3.2
Tu: Sep 8 — NP
Reading: AroraBarak: 2.1 & Sipser: 7.1-7.3
Th: Sep 10 — NP-Completeness
Reading: AroraBarak: 2.2-2.3 & Sipser: 7.4
Tu: Sep 15 — Cook-Levin Theorem
Reading: AroraBarak: 2.2-2.3 & Sipser: 7.4 [Trevisan/Williams Proof]
Th: Sep 17 — Proof of Cook-Levin Theorem
Reading: Sipser: 7.4 and 9.3
Tu: Sep 22 — Finish Cook-Levin Theorem
Reading: Sipser: 7.4 and 9.3
Th: Sep 24 — coNP
Reading: AroraBarak: 2.6-2.7
Tu: Sep 29 — Interactive Proofs
Reading: AroraBarak: 8.1 and Sipser 10.4
Th: Oct 1 — The SumCheck Protocol and #P
Reading: AroraBarak: 8.3 and Sipser 10.4
Tu: Oct 6 — Finish SumCheck
Reading: AroraBarak: 8.3 and Sipser 10.4
Th: Oct 8 — Zero-Knowledge Proofs
Reading: AroraBarak: 9.4
Tu: Oct 13 —
FALL BREAK: No Class
Th: Oct 15 —
Space Complexity
Reading: AroraBarak: 4.1 and Sipser 8.0
Tu: Oct 20 — Savitch's Theorem
Reading: AroraBarak: 4.2 and Sipser 8.1
Th: Oct 22 — NL and st-PATH
Reading: AroraBarak: 4.3 and Sipser 8.5
Tu: Oct 27 — PSPACE: TQBF
Reading: AroraBarak: 4.2 and Sipser 8.2-8.3
Th: Oct 29 — More on TQBF
Reading: AroraBarak: 4.2 and Sipser 8.2-8.3
Tu: Nov 3 — Randomized Computation Introduction
Reading: AroraBarak: 7.0-7.3
Th: Nov 5 — Error Reduction
Reading: AroraBarak: 7.4
Tu: Nov 10 — P/poly
Reading: AroraBarak: 6.3
Th: Nov 12 — BPP in P/poly, and P vs. BPP
Reading: AroraBarak: 7.5.1