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 — Complexity Classes Overview

Th: Sep 10 — Cook-Levin Theorem

Tu: Sep 15 — NP-Completeness

Th: Sep 17 — Oracle Complexity: Relativization Barrier

Tu: Sep 22 — coNP

Th: Sep 24 — Interactive Proof for Graph Non-Isomorphism

Tu: Sep 29 — Zero-Knowledge Proofs

Th: Oct 1 — Probabilistically Checkable Proofs

Tu: Oct 6 — Fine-Grained Complexity: Strong ETH and Orthogonal Vectors

Th: Oct 8 — Fine-Grained Reductions

Tu: Oct 13 — FALL BREAK: No Class

Th: Oct 15 — Space Complexity

Tu: Oct 20 — NL and st-PATH

Th: Oct 22 — Savitch's Theorem

Tu: Oct 27 — PSPACE: TQBF

Th: Oct 29 — Streaming Algorithms

Tu: Nov 3 — Streaming LBs via Myhill-Nerode Theorem

Th: Nov 5 — BPP Introduction

Tu: Nov 10 — Error Reduction

Th: Nov 12 — Boolean Circuits: P/poly

Tu: Nov 17 — BPP in P/poly, and P vs. BPP

Th: Nov 19 — TBD

Tu: Nov 24 — The Venn Diagram! Beyond 4814...

Th: Nov 26 — THANKSGIVING: No Class

Tu: Dec 1 — Presentations

Th: Dec 3 — Presentations