Cambridge University Press Computational Complexity

Be the first to review this product

 
$106.95

sku: 9780521424264

Availability: Out of stock

 

Quick Overview

  • ISBN: 9780521424264
  • Authors: Sanjeev Arora,Boaz Barak
  • Edition: 1
  • Publisher: Cambridge University Press
  • Publication Date: 16/06/2009
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.
 
Diaries sale Zip Pay Explore Bluey range
 

Details

Cambridge University Press Computational Complexity

Write Your Own Review

Only registered users can write reviews. Please, log in or register

Additional Information

Authors Sanjeev Arora,Boaz Barak
Barcode 9780521424264
Brand Cambridge University Press
Edition 1
ISBN 9780521424264
Publication Date 16/06/2009
Publisher Cambridge University Press