This beginning graduate textbook describes both recent achievements and classical results of computational complexity theory. Requiring essentially no background apart from mathematical maturity, the book can be used as a reference for self-study for anyone interested in complexity, including physicists, mathematicians, and other scientists, as well as a textbook for a variety of courses and seminars. More than 300 exercises are included with a selected hint set.

Author: Sanjeev Arora, Boaz Barak
Binding Type: Hardcover
Publisher: Cambridge University Press
Published: 04/20/2009
Pages: 594
Weight: 2.7lbs
Size: 9.90h x 7.30w x 1.60d
ISBN: 9780521424264

About the Author
Arora, Sanjeev: - 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.Barak, Boaz: - 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.