Processing ......
FreeComputerBooks.com
Links to Free Computer, Mathematics, Technical Books all over the World

Install LinkBasket to replace ALL of your new apps!
 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
 ISBN10: 0521424267
 ISBN13: 9780521424264
 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 selfstudy, 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.
About the Authors 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.
 Computational Complexity
 Algorithms and Data Structures
 Computational and Algorithmic Mathematics
 Parallel Computing and Programming
:






















