Get Free Shipping on orders over $79
Computational Complexity : A Modern Approach - Sanjeev Arora

Computational Complexity

A Modern Approach

By: Sanjeev Arora, Boaz Barak

eText | 20 April 2009 | Edition Number 1

At a Glance

eText


$113.95

or 4 interest-free payments of $28.49 with

 or 

Instant online reading in your Booktopia eTextbook Library *

Why choose an eTextbook?

Instant Access *

Purchase and read your book immediately

Read Aloud

Listen and follow along as Bookshelf reads to you

Study Tools

Built-in study tools like highlights and more

* eTextbooks are not downloadable to your eReader or an app and can be accessed via web browsers only. You must be connected to the internet and have no technical issues with your device or browser that could prevent the eTextbook from operating.

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.

on
Desktop
Tablet
Mobile

More in Computer Science

Amazon.com : Get Big Fast - Robert Spector

eBOOK

ReFormat : Windows 11 - Adam Natad

eBOOK

AI-Powered Search - Trey Grainger

eBOOK