Computational complexity
Sanjeev Arora
Reading Time
at 250 WPM10h 5m
The average reader, reading at a speed of 250 WPM, would take 10h 5m to read Computational complexity.
Personalise your estimate by entering your reading speed below
Test my reading speedEnter speed in words per minute
21
days at 30 min/day
605
total minutes
Computational complexity
Published
2009
Publisher
Cambridge University Press
Pages
605
ISBN-13
9781282390874
Description
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.
Subjects
Frequently Asked Questions
How many pages are in Computational complexity?
This edition of Computational complexity has approximately 605 pages. Please note, this is an estimate and the exact page count can vary between hardcover, paperback, and e-book versions.
How long does it take to read Computational complexity?
For most readers, Computational complexity typically takes between 12h 36m and 8h 24m to complete. This is based on the book's length of approximately 151,250 words and common reading speeds.
Here's a detailed breakdown: • Continuous reading at 250 WPM: approximately 10h 5m of focused reading • Casual reading (30 minutes/day): you could finish in roughly 21 days • Estimated word count: 151,250 words
Your individual reading time will vary based on your personal reading pace, the amount of daily reading time, and your familiarity with the subject matter.
What is the word count of Computational complexity?
The estimated word count for Computational complexity is approximately 151,250 words. This figure is calculated using industry-standard methods that consider genre-specific word density patterns, typical formatting and layout characteristics, and standard words-per-page ratios for published books.
This is an approximation — actual word count may vary based on font size, formatting, edition, and the presence of illustrations or charts.
Who is the author of Computational complexity?
Computational complexity was written by Sanjeev Arora.
When was Computational complexity published?
The publication date for this specific edition is 2009. The original work may have been published on a different date.