"Shows how to recognize NP-complete problems and offers proactical suggestions for dealing with them effectively. The book covers the basic theory of NP-complet

Provides an accessible introduction to computational complexity analysis and its application to questions of intractability in cognitive science.

Computational complexity is one of the most beautiful fields of modern mathematics, and it is increasingly relevant to other sciences ranging from physics to bi

Covering the basic techniques used in the latest research work, the author consolidates progress made so far, including some very recent and promising results,

An accessible and rigorous textbook for introducing undergraduates to computer science theory What Can Be Computed? is a uniquely accessible yet rigorous introd