Math 268 - Logic, Computation and Randomness

Dates: Winter 2011 thru Spring 2011
Lecturer: Sam Buss

The notes below are my handwritten versions of the lecture notes. They are rather messy, some pages may contain errors, and they were not intended for anyone else to see. However, I am posting them here as a permanent record.

The lectures were based mostly on the initial chapters of Computational Complexity: A Modern Approach by Sanjeev Arora and Boaz Barak, and also on material from Computational Complexity: A Conceptual Perspective by Oded Goldreich.

   Introduction to Complexity Theory. 50 pages.
   Interactive Proofs. 34 pages.
   Pseudorandomness and the Goldreich-Levin Theorem. 13 pages.

Back to Sam Buss's web page.