CS 710 - Complexity Theory Fall 2017

Lecture Notes

Notes for lectures with newly covered material are available below.
Notes from prior offerings are available via the Spring 2016 web site.

9/7	Introduction
9/12	Universality
9/14	Space-bounded nondeterminism
9/19	Time-bounded nondeterminism
9/21	Relativization
9/26	Alternation
9/28	Advice
10/3	Kernelization
10/5	Parallelism
10/10	Formulas
10/12	Constant-depth circuits
10/17	Randomness
10/19	Randomness vs alternation
10/24	Pseudorandomness
10/26	Hardness vs randomness
10/31	Randomness extraction
11/2	Expanders
11/7	Error reduction
11/9	Counting
11/14	Counting vs alternation
11/16	Interactive proofs
11/21	Arithmetization
11/28	Probabilistically checkable proofs
11/30	Zero-knowledge
12/5	Quantum computing
12/7	Fourier sampling
12/12	Amplitude amplification