CS 810 - Complexity Theory Spring 2007

Lecture Notes

Below you can find the lecture notes that are currently available as well as the tentative schedule for the rest of the semester.

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

File with all lectures (excluding finite fields handout): PDF (~ 2MB), PS (~ 45MB).

PDF file with some background on finite fields.

	Date	Topic	Scribe
1	1/22	Introduction: PS, TEX	Jeff Kinne
2	1/24	Determinism and Nondeterminism: PS, TEX	Matt Elder
3	1/24	NP-Completeness: PS, TEX	Baris Aydinlioglu
4	1/29	Time-Bounded Nondeterminism: PS, TEX	Baris Aydinlioglu
5	1/31	Space-Bounded Nondeterminism: PS, TEX	Matthew Anderson
6	2/2	Alternation: PS, TEX	Piramanayagam Arumuga Nainar
7	2/5	Nonuniformity: PS, TEX	Chi Man Liu
8	2/7	Constant-depth circuits: PS, TEX	Seeun William Umboh
9	2/9	Polynomial Approximations: PS, TEX	Piramanayagam Arumuga Nainar
10	2/12	Parallelism: PS, TEX	Matt Elder
11	2/14	Randomness: PS, TEX	Jake Rosin
12	2/16	Expanders: PS, TEX	Nathan Collins
13	2/19	Amplification: PS, TEX	Matthew Anderson
14	2/20	Space-Bounded Derandomization: PS, TEX	Jake Rosin
15	2/21	Time-Bounded Derandomization: PS, TEX	Thomas Watson
16	2/23	Error Correcting Codes: PS, TEX	Matt Elder
17	2/26	Worst-Case to Average-Case Reductions: PS, TEX	Thomas Watson
18	2/28	Randomness Extraction: PS, TEX	Jeff Kinne
19	3/1	Counting: PS, TEX	Chi Man Liu
20	3/2	Alternation vs Counting: PS, TEX	Jeff Kinne
21	3/19	Quantum Effects: PS, TEX	Seeun William Umboh
22	3/21	Proof Complexity: PS, TEX	Nathan Collins
23	3/26	Interactive Proofs: PS, TEX	Seeun William Umboh
24	3/28	Probabilistically Checkable Proofs: PS, TEX	Thomas Watson
25	3/30	Harmonic Analysis: PS, TEX	Nathan Collins
26	4/11	Cryptographic Primitives: PS, TEX	Chi Man Liu
27	4/13	Zero-Knowledge: PS, TEX	Matthew Anderson
28	4/16	Computational Learning Theory: PS, TEX	Jake Rosin
29	4/18	Query Complexity: PS, TEX	Jeff Kinne
30	4/20	Communication Complexity: PS, TEX	Piramanayagam Arumuga Nainar