DeepRead
Cover of Computational complexity

Computational complexity

Sanjeev Arora · 2007

Programming and computer science › Algorithms and coding interviews

#10,779 most recommended

About the book

This book is a graduate-level textbook on computational complexity theory, co-written by Sanjeev Arora and Boaz Barak. It starts with Turing machines and the basic time and space complexity classes, then covers probabilistic algorithms, interactive proofs, cryptography, and quantum computation. It requires mathematical maturity rather than prior background in the field, and it includes over 300 exercises with a selected hint set. The book does not advance a single thesis. It treats complexity theory as organised around a few questions: which problems admit efficient algorithms, how randomness, interaction, and quantum resources change what is efficiently computable, and why proving lower bounds is so hard. It presents recent results such as the PCP theorem and derandomization through pseudorandom constructions as revising earlier answers, and it develops lower-bound techniques for restricted models like circuits and decision trees as partial progress toward P versus NP.

Written by Claude from what it knows of this book.

What Hacker News says 100% recommend · 0% critical

024201320142016201820192019 peak · 2
This bookAverage book in Algorithms and coding interviews

In the commenters’ own words

What Open Library readers say

No Open Library reader has rated it yet.

  • 7 want to read
  • 0 reading
  • 0 have read

Open Library’s page for the book

What critics say, via Wikipedia

No Wikipedia article about this book yet, so no critics to quote.

Reddit communities — coming later

The threads it came up in

Details

First published
2007
ISBN
9780521424264
Editions known
12 at Open Library
Open Library
OL13759314W

511.3/52Computational complexityComputer TechnologyElectronic data processingNonfictionQa267.7 .a76 2009

Explore in the mosaic

Read next: its neighbours on the mosaic