Computational Complexity: A Modern Approach - Boaz Barak,Sanjeev Arora
-20% with code BOOKS
Shipping in 10-16 days
30-day return policy
Describes recent achievements and classical results of computational complexity theory, including interactive proofs, PCP, derandomization, and quantum computation. It can be used as a reference, for self-study, or as a beginning graduate textbook. More than 300 exercises are included.
You May Also Like
Description
Describes recent achievements and classical results of computational complexity theory, including interactive proofs, PCP, derandomization, and quantum computation. It can be used as a reference, for self-study, or as a beginning graduate textbook. More than 300 exercises are included.
More Information
| Author | Boaz Barak, Sanjeev Arora |
|---|---|
| Publisher | Cambridge University Pr. |
| Release year | 2009 |
| Cover type | Hardcover |
| EAN | 9780521424264 |