**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.

Download or read it online for free here:

**Download link**

(0.9MB, PDF)

## Similar books

**Foundations of Cryptography**

by

**Oded Goldreich**-

**Cambridge University Press**

The book gives the mathematical underpinnings for cryptography; this includes one-way functions, pseudorandom generators, and zero-knowledge proofs. Throughout, definitions are complete and detailed; proofs are rigorous and given in full.

(

**10421**views)

**Algorithmic Randomness and Complexity**

by

**R. G. Downey, D. R. Hirschfeldt**-

**Springer**

Computability and complexity theory are two central areas of research in theoretical computer science. This book provides a systematic, technical development of algorithmic randomness and complexity for scientists from diverse fields.

(

**4910**views)

**Introduction to Computational Complexity**

by

**Martin Tompa**

Lecture notes for a graduate course on computational complexity taught at the University of Washington. Alternating Turing machines are introduced very early, and deterministic and nondeterministic Turing machines treated as special cases.

(

**5449**views)

**Solving NP-Complete Problems**

by

**F. D. Lewis**-

**University of Kentucky**

This is an on-line textbook on heuristic algorithms. From the table of contents: Classes of Problems; Integer Programming; Enumeration Techniques; Dynamic Programming; Approximate Solutions; Local Optimization; Natural Models.

(

**4624**views)