 Date
 Topic

1 
1/21 
Introduction
[notes] 
2 
1/23 
Universality
[notes] 
3 
1/26 
Reductions and completeness
[notes] 
4 
1/30 
Nondeterminism
[notes] 
5 
2/2 
Timebounded nondeterminism
[notes] 
6 
2/4 
Relativization
[notes] 
7 
2/6 
Spacebounded nondeterminism
[notes] 
8 
2/9 
Alternation
[notes]

9 
2/16 
The polynomialtime hierarchy
[notes]

10 
2/18 
Timespace lower bounds
[notes]

11 
2/20 
Nonuniformity
[notes]

12 
2/23 
Lower bounds for constantdepth circuits
[notes]

13 
2/25 
Parallellism
[notes]

14 
2/27 
Randomness
[notes]

15 
3/2 
More randomness
[notes]

16 
3/4 
Expanders
[notes]

17 
3/6 
Randomnessefficient error reduction
[notes]

18 
3/9 
Pseudorandom generators
[notes]

19 
3/11 
Spacebounded derandomization
[notes]

20 
3/16 
Timebounded derandomization
[notes]

21 
3/18 
Worstcase to averagecase reductions
[notes 
more notes]

22 
3/20 
Randomness extraction
[notes]

23 
3/23 
Counting
[notes]

24 
3/25 
Approximate counting in the polynomialtime hierarchy
[notes 
more notes]

25 
3/27 
Reduction of the polynomialtime hierarchy to counting
[notes]

26 
4/6 
Interactive proofs
[notes]

27 
4/8 
Probabilistically checkable proofs
[notes]

28 
4/13 
The PCP theorem
[notes]

29 
4/15 
Zeroknowledge
[notes]
