This beginning graduate textbook describes both 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 textbook. More than 300 exercises are included.
Title Computational Complexity: A Modern Approach
Author(s) Sanjeev Arora, Boaz Barak
Publisher: Cambridge University Press; 1 edition (April 20, 2009)
Hardcover 594 pages
Language: English
ISBN-10: 0521424267
ISBN-13: 978-0521424264
eBook: http://www.cs.princeton.edu/theory/complexity/
Author(s) Sanjeev Arora, Boaz Barak
Publisher: Cambridge University Press; 1 edition (April 20, 2009)
Hardcover 594 pages
Language: English
ISBN-10: 0521424267
ISBN-13: 978-0521424264
eBook: http://www.cs.princeton.edu/theory/complexity/
No comments:
Post a Comment