The Leading eBooks Store Online 4,385,058 members ⚫ 1,459,539 ebooks

New to eBooks.com?

Learn more

Computational Complexity

A Modern Approach

Computational Complexity by Sanjeev Arora
Buy this eBook
US$ 52.00 US$ 46.99
(If any tax is payable it will be calculated and shown at checkout.)
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. The book starts with a broad introduction to the field and progresses to advanced results. Contents include: definition of Turing machines and basic time and space complexity classes, probabilistic algorithms, interactive proofs, cryptography, quantum computation, lower bounds for concrete computational models (decision trees, communication complexity, constant depth, algebraic and monotone circuits, proof complexity), average-case complexity and hardness amplification, derandomization and pseudorandom constructions, and the PCP theorem.
Cambridge University Press; April 2009
608 pages; ISBN 9781139234757
Read online, or download in secure EPUB or secure PDF format
Title: Computational Complexity
Author: Sanjeev Arora; Boaz Barak
 
ISBNs
0511530757
9780511530753
9780521424264
9781139234757