Loading...
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 sol...
| Main Author: | |
|---|---|
| Format: | Printed Book |
| Language: | English |
| Published: |
New York :
Cambridge University Press,
2010.
|
| Subjects: | |
| Online Access: | Cover image |
Table of Contents:
- Machine generated contents note: 1. Computational tasks and models; 2. The P versus NP Question; 3. Polynomial-time reductions; 4. NP-completeness; 5. Three relatively advanced topics; Epilogue: a brief overview of complexity theory.