Skip to content

Computational Complexity A Modern Approach

Spend $50 to get a free movie!

ISBN-10: 0521424267

ISBN-13: 9780521424264

Edition: 2009

Authors: Sanjeev Arora, Boaz Barak

List price: $102.95
Blue ribbon 30 day, 100% satisfaction guarantee!
Out of stock
what's this?
Rush Rewards U
Members Receive:
Carrot Coin icon
XP icon
You have reached 400 XP and carrot coins. That is the daily max!

Customers also bought

Book details

List price: $102.95
Copyright year: 2009
Publisher: Cambridge University Press
Publication date: 4/20/2009
Binding: Hardcover
Pages: 594
Size: 7.00" wide x 10.00" long x 1.25" tall
Weight: 2.684
Language: English

Boaz Barak is an assistant professor in the department of computer science at Princeton University. He holds a Ph.D. from the Weizmann Institute of Science.

Basic Complexity Classes
The computational model - and why it doesn't matter
NP and NP completeness
Diagonalization
Space complexity
The polynomial hierarchy and alternations
Boolean circuits
Randomized computation
Interactive proofs
Cryptography
Quantum computation
PCP theorem and hardness of approximation: an introduction
Lower Bounds for Concrete Computational Models
Decision trees
Communication complexity
Circuit lower bounds
Proof complexity
Algebraic computation models
Advanced Topics
Complexity of counting
Average case complexity: Levin's theory
Hardness amplification and error correcting codes
Derandomization
Pseudorandom constructions: expanders and extractors
Proofs of PCP theorems and the Fourier transform technique
Why are circuit lower bounds so difficult?
mathematical background