CS 710 - Complexity Theory

Spring 2016

Lecture Notes

	Date	Topic
1	1/19	Introduction [notes ]
2	1/21	Universality [notes ]
3	1/26	Nondeterminism [notes ] \| [more notes ]
4	1/28	Time-bounded nondeterminism [notes ] \| [more notes ]
5	2/2	Space-bounded nondeterminism [notes ] \| [more notes ]
6	2/9	Relativization [notes ] \| [more notes ]
7	2/11	Alternation [notes ] \| [more notes ]
8	2/16	Nonuniformity [notes ] \| [more notes ]
9	2/18	Constant-depth circuits [notes ]
10	2/23	Parallellism [notes ]
11	2/25	Constant-width branching programs [notes ]
12	3/1	Randomness [notes ]
13	3/3	Randomness vs alternation [notes ]
14	3/8	Derandomization [notes ] \| [more notes ]
15	3/10	Counting [notes ] \| [more notes ]
16	3/15	Counting vs alternation [notes ]
17	3/17	Interactive proofs [notes ]
18	3/29	Public vs private coins [notes ]
19	3/31	Arithmetization [notes ]
20	4/5	Probabilistically checkable proofs [notes ]
21	4/7	The PCP theorem [notes]
22	4/12	Harmonic analysis [notes]
23	4/14	Hardness of approximation [notes]
24	4/19	Cryptographic primitives [notes]
25	4/21	Zero-knowledge [notes]
26	4/26	Quantum computing [notes] \| [more notes]
27	4/28	Fourier sampling [notes] \| [more notes]
28	5/3	Amplitude amplification [notes]
29	5/5	Quantum information [notes]

Computer Sciences | UW Home

Feedback or content questions: send email to "dieter" at the cs.wisc.edu server
Technical or accessibility issues: [email protected]
Copyright © 2002-2016 The Board of Regents of the University of Wisconsin System.