Lectures

  1. 1/21/02 Course intro, crossing sequence arguments
  2. 1/23/02 Time and space complexity classes, Savitch's theorem
  3. 1/25/02 Time and space separation results
  4. 1/28/02 Logspace computability
  5. 2/1/02 Immerman/Szelepcsenyi theorem
  6. 2/4/02 Circuit value problem and the Cook/Levin theorem
  7. 2/6/02 Alternation
  8. 2/8/02 Complexity of two-person games
  9. 2/11/02 The polynomial time hierarchy
  10. 2/13/02 More on the polynomial time hierarchy
  11. 2/15/02 Parallel complexity
  12. 2/18/02 Relation of NC to time/space classes
  13. 2/20/02 Probabilistic computation
  14. 2/22/02 BPP contained in Sigma-2-P intersect Pi-2-P
  15. 2/25/02 Interactive Proofs
  16. 2/29/02 PSPACE subset of IP
  17. 3/1/02 IP subset of PSPACE
  18. 3/4/02 Probabilistically checkable proofs
  19. 3/6/02 PCP continued
  20. 3/8/02 no class
  21. 3/11/02 Complexity of decidable theories
  22. 3/13/02 Ehrenfeucht-Fraisse games
  23. 3/15/02 Complexity of real addition
  24. 3/25/02 Lower bound for real addition
  25. 3/27/02 Lower bound for Presburger arithmetic
  26. 3/29/02 Automata on infinite strings and S1S
  27. 4/1/02 Determinization of omega-automata
  28. 4/3/02, 4/5/02 Safra's construction
  29. 4/8/02 Relativized complexity
  30. 4/10/02 Nonexistence of sparse complete sets
  31. 4/12/02 Partial recursive functions and Goedel numberings
  32. 4/15/02 Applications of the recursion theorem
  33. 4/17/02 The arithmetic hierarchy
  34. 4/19/02 Complete problems in the arithmetic hierarchy
  35. 4/22/02 Post's problem
  36. 4/24/02 The Friedberg-Muchnik theorem
  37. 4/26/02 The analytic hierarchy
  38. 4/29/02 Inductive definability and Kleene's theorem
  39. 5/1/02 Fair termination and Harel's theorem

 

Supplementary Lectures

  1. 2/6/02 The Knaster-Tarski theorem
  2. 2/22/02 Primality is in NP intersect co-NP
  3. 2/25/02 Chinese remaindering and Berlekamp's algorithm