Processing ......
FreeComputerBooks.com
Free Computer, Mathematics, Technical Books and Lecture Notes, etc.
 
Computational Complexity: A Modern Approach
How many Airports in your home state/province? Click here to find out.
  • Title Computational Complexity: A Modern Approach
  • Author(s) Sanjeev Arora, Boaz Barak
  • Publisher: Cambridge University Press; 1 edition (April 20, 2009)
  • 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.

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.
Reviews and Rating: Related Book Categories: Read and Download Links: Similar Books:
Book Categories
Other Categories
Resources and Links