Computability and complexity
by Neil D. Jones · first published 1997
2mentions
1recommended by
2HN commenters
2015–2018first – last mentioned
50% recommend50% neutral
Affiliate links. As an Amazon Associate I earn from qualifying purchases.
Computability and Complexity by Neil Jones: http://www.diku.dk/~neil/comp2book2007/book-whole.pdf It is extremely readable and presents very theoretical concepts in a pragmatic way. Love it.
on “Ask HN: What's the best textbook you've read?” ↗…Computer Scientists than Physicists, I believe, but I think it is pretty understandable in general. I think Sipser is probably the best introduction to Computation if you do not have a background in Computability and Complexity. Arora and Barak's text has a much larger breadth and is much more detailed as far as Complexity goes. It is the more appropriate of the two if you are just interested in Computational Complexity.
on “A Polynomial Time Bounded-Error Quantum Algorithm for Boolean Satisfiability” ↗