P, NP, and NP-completeness : the basics of computational complexity /
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
New York :
Cambridge University Press,
2010.
|
| Subjects: |
Table of Contents:
- Computational tasks and models
- The P versus NP question
- Polynomial-time reductions
- NP-completeness
- Three relatively advanced topics
- Epilogue: a brief overview of complexity theory.