Skip to main content
Select the department you want to search in
Audible Books & Originals
Apps & Games
Arts, Crafts & Sewing
Automotive Parts & Accessories
Beauty & Personal Care
CDs & Vinyl
Cell Phones & Accessories
Clothing, Shoes & Jewelry
Collectibles & Fine Art
Credit and Payment Cards
Digital Educational Resources
Garden & Outdoor
Grocery & Gourmet Food
Health, Household & Baby Care
Home & Business Services
Home & Kitchen
Industrial & Scientific
Just for Prime
Luggage & Travel Gear
Movies & TV
Sports & Outdoors
Tools & Home Improvement
Toys & Games
Hello, Sign in
Account & Lists
Select your address
Find a Gift
Disability Customer Support
School Supplies Guide
Sorry, you don't meet eligibility requirements
To create an Idea List, you must be eligible according to the
If you are a verified customer (have a blue checkmark) and received this error, please contact
Oops! We couldn't create your list
An error has occurred. Please try again later.
Create a New Idea List
Idea List Name
This Idea List is public
Idea List Description (optional)
#FoundItOnAmazon Go to homepage.
Favorite Computational Complexity Books
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
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)
Great introduction to theory especially the sections on automata.
Introduction to the Theory of Computation
Great textbook for advanced complexity topics.
Computational Complexity: A Modern Approach
Nice coverage of major results in algorithms.
Introduction to Algorithms, Second Edition
Excellent surveys on complexity.
Handbook of Theoretical Computer Science, Vol. A: Algorithms and Complexity
An amazingly fun book to read on quantum computing and beyond.
Quantum Computing Since Democritus
Readable computational approach to quantum from physicists.
Quantum Computation and Quantum Information (Cambridge Series on Information and the Natural Sciences)
Great introduction and reference for Kolmogorov Complexity.
An Introduction to Kolmogorov Complexity and Its Applications (Texts in Computer Science)
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) (Volume 125)
Every topic in complexity should have a book like this.
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)
Probabilistic Method is a powerful tool in complexity. Also has nice section on Chernoff bounds.
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)
Heart this idea list to save it
Inspire others and create your own
+ Create an Idea List
View all Idea Lists
There's a problem loading this menu right now.
Learn more about Amazon Prime.
Get free delivery with Amazon Prime
Prime members enjoy FREE Delivery and exclusive access to music, movies, TV shows, original audio series, and Kindle books.