x dismiss this message
Did you know you can edit this page?
-
Sign Into Shelfari
-
Choose something to edit
-
Save your contributions
see page history
Description edit
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... read more
Ridiculously Simplified Synopsis edit
Classification edit
- Library of Congress: Add the Library of Congress Classification.
- Dewey: 005.1
Subjects edit
Popular Tags
We’re hiding the errata, movie connections, books that influenced this book, books influenced by this book, books that cite this book and books cited by this book sections. If you would like to add content to them, you must first make them visible.
