
Computational complexity
Christos H. Papadimitriou · 1994
Programming and computer science › Algorithms and coding interviews
#4,623 most recommended
Hacker News
9
mentions by 9 people · top 32% of 15,732 books
Open Library
—
No ratings yet
2 want to read
Wikipedia
—
No article yet
About the book
A graduate-level textbook on computational complexity theory. It covers the formal models of computation, the resources of time and space needed to solve problems, and the classes of problems those resources define, including P, NP, and PSPACE. It also extends to randomized computation, circuits, and approximation. The book treats computational complexity as a way to classify problems by how much time, space, or other resources they require, and it presents the reductions and completeness results that organize those problems into a structured landscape. Its central theme is that many natural problems fall into a small number of hard classes, so these classes are the right tool for understanding intractability. It frames open questions such as whether P equals NP as the main organizing problems of the field, and it shows how the known relationships among complexity classes constrain what can be proven.
Written by Claude from what it knows of this book.
What Hacker News says 78% recommend · 0% critical
In the commenters’ own words
Mmm, certainly. Hoffstein et al.'s An Introduction to Mathematical Cryptography is a wonderful text, highly thought of, that really is a better choice than…
"Quantum Computing Since Democritus" mentioned in the other answer is definitely good fun, but I find it a bit tricky in places and it very much has a quantum…
What Open Library readers say
No Open Library reader has rated it yet.
- 2 want to read
- 0 reading
- 0 have read
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
- 1994
- ISBN
- 9780201530827
- Editions known
- 2 at Open Library
- Open Library
- OL1891354W
511.3Computational complexityQa267.7 .p36 1994
Read next: its neighbours on the mosaic
Elements of the Theory of ComputationLewis, Harry R., and Christos H. Papadimitriou · 1981 · recommended by 5 people · similar by subject and what people say about it
Computers and intractabilityMichael R. Garey · 1979 · recommended by 5 people · similar by subject and what people say about it
Introduction to the theory of computationMichael Sipser · 1997 · recommended by 66 people · similar by subject and what people say about it
Introduction to automata theory, languages, and computationJohn E. Hopcroft · 1979 · recommended by 24 people · similar by subject and what people say about it
The nature of computationCristopher Moore · 2009 · recommended by 10 people · similar by subject and what people say about it
Theory of computationMichael Sipser · 2007 · recommended by 14 people · similar by subject and what people say about it
Computational complexitySanjeev Arora · 2007 · recommended by 3 people · similar by subject and what people say about it
Computability and complexityNeil D. Jones · 1997 · recommended by 1 person · similar by subject and what people say about it
Combinatorial optimizationChristos H. Papadimitriou · 1981 · recommended by 1 person · similar by subject and what people say about it
TuringChristos H. Papadimitriou · 2005 · recommended by 2 people · similar by subject and what people say about it
Combinatorial OptimizationAlexander Schrijver · 2003 · recommended by 1 person · similar by subject and what people say about it
An introduction to Kolmogorov complexity and its applicationsMing Li · 1993 · recommended by 5 people · similar by subject and what people say about it
AlgorithmsChristos H. Papadimitriou · 2006 · recommended by 4 people · similar by subject and what people say about it
Quantum Computing Since DemocritusScott Aaronson · 2013 · recommended by 73 people · similar by subject and what people say about it
ComputationMarvin Minsky · 1967 · recommended by 5 people · similar by subject and what people say about it
Complexity and real computationLenore Blum · 1998 · recommended by 2 people · similar by subject and what people say about it
Computer architectureJohn L. Hennessy · 1989 · recommended by 59 people · similar by subject and what people say about it
Quantum computation and quantum informationMichael A. Nielsen · 2000 · recommended by 30 people · similar by subject and what people say about it
Introduction to AlgorithmsThomas H. Cormen · 1990 · recommended by 274 people · similar by subject and what people say about it
The art of computer programmingDonald Knuth · 1968 · recommended by 336 people · similar by subject and what people say about it
An introduction to mathematical cryptographyJeffrey Hoffstein · 2008 · recommended by 5 people · similar by subject and what people say about it
Algorithm designJon Kleinberg · 1922 · recommended by 30 people · similar by subject and what people say about it
Feynman lectures on computationRichard Phillips Feynman · 1996 · recommended by 17 people · similar by subject and what people say about it
Computer systemsRandal Bryant · 2002 · recommended by 67 people · similar by subject and what people say about it