• Title Computational Complexity: A Modern Approach
• Author(s) Sanjeev Arora, Boaz Barak
• Publisher: Cambridge University Press; 1 edition (April 20, 2009); eBook (Drafts of the Book)
• Hardcover 594 pages
• eBook Online, HTML and PDF files
• Language: English
• ISBN-10: 0521424267
• ISBN-13: 978-0521424264
• Share This:  

Book Description

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.

Computational complexity theory is at the core of theoretical computer science research. This book contains essentially all of the (many) exciting developments of the last two decades, with high level intuition and detailed technical proofs. It is a must for everyone interested in this field.

• Sanjeev Arora is a Professor in the department of computer science at Princeton University. He holds a Ph.D. from the University of California, Berkeley and has done foundational work in complexity theory, probabilistically checkable proofs, and approximation algorithms.
• Boaz Barak is an assistant professor in the department of computer science at Princeton University. He holds a Ph.D. from the Weizmann Institute of Science.

• Amazon

• Computational Complexity
• Algorithms and Data Structures
• Computational and Algorithmic Mathematics
• Parallel Computing and Programming

• Computational Complexity: A Modern Approach (Sanjeev Arora, Boaz Barak)
• The Mirror Site (1) - 2006 Draft - PDF (562 pages, 4.0 MB)
• The Mirror Site (2) - 2006 Draft - PDF (562 pages, 4.0 MB)
• The Mirror Site (3) - PDF (Online Edition)

• Think Complexity: Science and Modeling, 2nd Ed. (Allen Downey)
• Computability and Complexity: From a Programming Perspective
• Computational Complexity: A Conceptual Perspective (Goldreich)