About
Sign in
Join
Computational Complexity
A Modern Approach
Sanjeev Arora,
Boaz Barak
—
2009
New and classical results in computational complexity, including interactive proofs, PCP, derandomization, and quantum computation. Ideal for graduate students.
Buy
Want to read
Sign up to use
Share
0
Reviews
0
Highlights
0
Currently reading
0
Finished
4
Want to read