Favorite Computational Complexity Books 1

Of course I have to lead off with my pop sci book on the great P v NP problem. If you want a bit more technical discussion check out the nex
The Golden Ticket: P, NP, and the Search for the Impossible
The Golden Ticket: P, NP, and the Search for the Impossible
$20.00
Every computer scientist should have this one. Both a great introduction to the P versus NP problem and a very useful list of NP-complete pr
Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences)
Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences)
$84.00
Great introduction to theory especially the sections on automata.
Introduction to the Theory of Computation
Introduction to the Theory of Computation
Great textbook for advanced complexity topics.
Computational Complexity: A Modern Approach
Computational Complexity: A Modern Approach
$53.00
Nice coverage of major results in algorithms.
Introduction to Algorithms, Second Edition
Introduction to Algorithms, Second Edition
Excellent surveys on complexity.
Handbook of Theoretical Computer Science, Vol. A: Algorithms and Complexity
Handbook of Theoretical Computer Science, Vol. A: Algorithms and Complexity
$119.00
An amazingly fun book to read on quantum computing and beyond.
Quantum Computing since Democritus
Quantum Computing since Democritus
$39.00
Readable computational approach to quantum from physicists.
Quantum Computation and Quantum Information (Cambridge Series on Information and the Natural Sciences)
Quantum Computation and Quantum Information (Cambridge Series on Information and the Natural Sciences)
$96.00
Great introduction and reference for Kolmogorov Complexity.
An Introduction to Kolmogorov Complexity and Its Applications (Texts in Computer Science)
An Introduction to Kolmogorov Complexity and Its Applications (Texts in Computer Science)
$70.00
Computability theory spelled out nicely.
Classical Recursion Theory: The Theory of Functions and Sets of Natural Numbers, Vol. 1 (Studies in Logic and the Foundations of Mathematics, Vol. 125)
Classical Recursion Theory: The Theory of Functions and Sets of Natural Numbers, Vol. 1 (Studies in Logic and the Foundations of Mathematics, Vol. 125)
$83.00
Every topic in complexity should have a book like this.
Communication Complexity
Communication Complexity
Computation is manipulating information so useful to have this great book on Information Theory.
Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)
Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)
Probabilistic Method is a powerful tool in complexity. Also has nice section on Chernoff bounds.
The Probabilistic Method
The Probabilistic Method
Surprising logical characterizations of computational complexity classes in the well written book by the master himself.
Descriptive Complexity (Texts in Computer Science)
Descriptive Complexity (Texts in Computer Science)
$85.00
Heart this idea list to save it
Inspire others and create your own