Lectures

  1. 1/26 Complexity of Computations
  2. 1/28 Time and Space Complexity Classes, Savitch's Theorem
  3. 1/30 Separation Results
  4. 2/2 Immerman-Szelepcsenyi Theorem
  5. 2/4 Logspace Computability
  6. 2/6 Circuit Value Problem
  7. 2/9 Alternation
  8. 2/11 Problems Complete for PSPACE
  9. 2/13 Polynomial Time Hierarchy
  10. 2/16 More on the Polynomial Time Hierarchy
  11. 2/18 Parallel Complexity
  12. 2/18 Relation of NC to Time-Space Classes
  13. 2/20 Probabilistic Complexity
  14. 2/23 BPP subset Sigma^p_2 intersect Pi^p_2
  15. 3/1 Interactive Proofs
  16. 3/3 PSPACE subset IP
  17. 3/5 IP subset PSPACE
  18. 3/8 PCP and Hardness of Approximation
  19. 3/10 NP subset PCP(log n,1)
  20. 3/12 More on PCP
  21. 3/17 Complexity of Decidable Theories
  22. 3/19 Complexity of the Theory of Real Addition
  23. 3/29 Lower Bound for the Theory of Real Addition
  24. 3/31 Lower Bound for Integer Addition
  25. 4/2 Relativized Complexity
  26. 4/5 Nonexistence of Sparse Complete Sets
  27. 4/7 Alternative Proof of Mahaney's Theorem
  28. 4/9 Hartmanis 2
  29. 4/12 Automata on Infinite Strings and S1S
  30. 4/14 Determinization of omega-automata
  31. 4/16 Safra's Construction
  32. 4/19 Partial Recursive Functions and Gödel Numberings
  33. 4/21 Applications of the Recursion Theorem
  34. 4/23 The Arithmetic Hierarchy
  35. 4/26 Complete Problems in the Arithmetic Hierarchy
  36. 4/28 Post's Problem
  37. 4/30 The Friedberg-Muchnik Theorem
  38. 5/3 The Analytic Hierarchy
  39. 5/5 Kleene's Theorem
  40. 5/7 Fair Termination and Harel's Theorem

Supplementary Lectures

  1. 2/6 Knaster-Tarski Theorem
  2. 2/25 Chinese Remainder Theorem
  3. 2/25 Primality Testing
  4. 3/15 Berlekamp's Algorithm
  5. 3/15 Crash Course in Logic