Computational Complexity
A Modern Approach
description
New and classical results in computational complexity, including interactive proofs, PCP, derandomization, and quantum computation. Ideal for graduate students.
read more
pages
609
Year published
2009
Publisher
Cambridge University Press
Issn
978-0-521-42426-4
Language
en
categories