P, NP, and NP-Completeness: The Basics of Computational Complexity
The focus of this book is the P-versus-NP Question and the theory of NP-completeness. It also provides adequate preliminaries regarding computational problems and computational models. The P-versus-NP Question asks whether or not finding solutions is harder than checking the correctness of solutions. An alternative formulation asks whether or not discovering proofs is hard...more
Paperback, 184 pages
Published August 1st 2010 by Cambridge University Press
(first published August 30th 2006)
To see what your friends thought of this book, please sign up.
(showing 1-30 of 34)