Computational Complexity - A Modern Approach (Hardcover)

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.

General

Imprint:	Cambridge UniversityPress
Country of origin:	United Kingdom
Release date:	April 2009
First published:	May 2009
Authors:	Sanjeev Arora • Boaz Barak
Dimensions:	260 x 182 x 35mm (L x W x T)
Format:	Hardcover
Pages:	579
ISBN-13:	978-0-521-42426-4
Categories:	Books > Reference & Interdisciplinary > Communication studies > Coding theory & cryptology Books > Computing & IT > General theory of computing > Mathematical theory of computation Promotions
LSN:	0-521-42426-7
Barcode:	9780521424264

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!