Computational complexity
by Sanjeev Arora · first published 2007
100% recommend
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 ma
Affiliate links. As an Amazon Associate I earn from qualifying purchases.
Mentions per year
What Hacker News says
Related books
2007–2026Introduction to Algorithms
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein
Recommended by 274 · mentioned by 712274 recommend · 712 mention274 recommend · 712274 recommend
2007–2026Structure and Interpretation of Computer Programs
Harold Abelson, Gerald Jay Sussman, Julie Sussman
Recommended by 347 · mentioned by 602347 recommend · 602 mention347 recommend · 602347 recommend
2007–2026The art of computer programming
Donald Knuth
Recommended by 336 · mentioned by 1,125336 recommend · 1,125 mention336 recommend · 1,125336 recommend
There's so much more to CS theory than big O notation and you're in for a treat if you check out any of the below - happy to share more if people are interested. 1. https://www.amazon.com/Computational-Complexity-Approach-San... 2. https://www.amazon.com/Quantum-Computing-since-Democritus-Aa... 3. https://www.amazon.com/G%C3%B6del-Escher-Bach-Eternal-Golden... 4. https://www.amazon.com/Introduction-Theory-Computation-Micha...
on “Ask HN: What book to read to get a footing in CS theory?” ↗…http://www.amazon.com/The-Nature-Computation-Cristopher-Moor... I loved this book very much. It has a very informal and conversational style (don't let it fool you, the problem sets can be HARD). * http://www.amazon.com/Computational-Complexity-A-Modern-Appr... Once you are familiar with some computation models, its time to study computational complexity and this is one of the best books on the subjects. It is used both for graduate and undergraduate…
on “The Art of Computer Programming - eBook” ↗…True, but I think he does a good job of explaining things. This lecture on incompleteness seemed accessible to me https://www.youtube.com/watch?v=0Zmfv3jsiQ0&t=1788s There's also Sanjeev Arora's book "Computational Complexity: A Modern Approach" https://theory.cs.princeton.edu/complexity/book.pdf