CS 710 - Complexity Theory Spring 2010

Lecture Notes

Below you can find the lecture notes that are currently available as well as the tentative schedule for the near future.

For information on how to write up your scribe notes in LaTeX, check out these guidelines.

	Date	Topic	Scribe
1	1/19	Introduction: PDF, TEX	Jeff Kinne
2	1/21	Universality: PDF, TEX	Tyson Williams
3	1/26	NP-Completeness: PDF, TEX	Andrew Bolanowski
4	1/28	Time-Bounded Nondeterminism: PDF, TEX	Dmitri Svetlov
5	2/2	Space-Bounded Nondeterminism: PDF, TEX	Michael Correll
6	2/4	Alternation: PDF, TEX	Ashutosh Kumar
7	2/9	Nonuniformity: PDF, TEX	Mushfeq Khan
8	2/11	Circuit lower bounds: draft PDF, draft TEX	Chris Hopman
9	2/16	Lower bounds for constant-depth circuits: PDF, TEX	Phil Rydzewski
10	2/18	Parallellism: PDF, TEX	Theodora Hinkle
11	2/23	Randomness: PDF, TEX	Brian Rice
12	2/25	Randomness Continued: PDF, TEX	Beth Skubak
13	3/2	Expanders: PDF, TEX	Amanda Hittson
14	3/4	Amplification: PDF, TEX	Tyson Williams
15	3/9	Space-Bounded Derandomization: PDF, TEX	Amanda Hittson
16	3/11	Pseudorandomness: PDF, TEX,	Michael Correll
17	3/16	Time-Bounded Derandomization: PDF, TEX	Andrew Bolanowski
18	3/18	Error Correcting Codes: PDF, TEX	Dmitri Svetlov
19	3/23	Worst-Case to Average-Case Reductions: PDF, TEX	Brian Rice
20	3/25	List Decoding: old PDF 17, old TEX 17	Theodora Hinkle
21	4/6	Randomness Extraction: PDF, TEX	Beth Skubak
22	4/8	Counting: PDF, TEX,	Phil Rydzewski
23	4/13	Alternation vs Counting: PDF, TEX	Mushfeq Khan
24	4/15	Arthur-Merlin Games: PDF, TEX	Ashutosh Kumar
25	4/20	Interactive Proofs: PDF, TEX	Chris Hopman
26	4/22	Probabilistically Checkable Proofs: draft PDF, draft TEX	Andrew Bolanowski
27	4/27	The PCP Theorem: PDF, TEX	Dmitri Svetlov
28	4/29	Harmonic Analysis: PDF, TEX	Andrew Bolanowski
29	5/4	Computational Learning Theory: PDF, TEX	Dmitri Svetlov
30	5/6	Quantum Effects: PDF, TEX	Seeun William Umboh