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.
I have a question about the book:
‘Computational Complexity - Arora, Sanjeev (Princeton University, Barak, Boaz (Princeton University’.
Fill in the form below.
We will respond as fast as possible.
