Welcome to E-Books Directory
This is a freely downloadable e-book.

Lecture Notes on Computational Complexity
by Luca Trevisan

2004
Number of pages: 171

Description:
These are notes from a graduate courses on Computational Complexity offered at the University of California at Berkeley. The first 15 lectures cover fundamental material. The remaining lectures cover more advanced material - there are lectures on Hastad's optimal inapproximability results, lower bounds for parity in bounded depth-circuits, lower bounds in proof-complexity, and pseudorandom generators and extractors.

Home page url

 Download or read it online here:

Download link

 (0.9MB, PDF)