P, NP, and NP-Completeness : The Basics of Computational Complexity
Oded. Goldreich
Bok Engelsk 2010 · Electronic books.
| Annen tittel | |
|---|---|
| Utgitt | Cambridge : Cambridge University Press , 2010
|
| Omfang | 1 online resource (216 p.)
|
| Opplysninger | Description based upon print version of record.. - Cover; Half-title; Title; Copyright; Contents; List of Figures; Preface; Overview; To the Teacher; Notations and Conventions; Main Definitions and Results; 1 Computational Tasks and Models; 2 The P versus NP Question; 3 Polynomial-time Reductions; 4 NP-Completeness; 5 Three Relatively Advanced Topics; Historical Notes; Epilogue: A Brief Overview of Complexity Theory; Appendix: Some Computational Problems; Bibliography; Index. - Starting from the basics of computability, this undergraduate introduction focuses on the P versus NP Question and the theory of NP-completeness.
|
| Emner | Approximation theory
Computational complexity Computer algorithms Polynomials Vis mer... Algebra
Algoritmer - Databehandling Kompleksitetsteori Mathematics Physical Sciences & Mathematics Polynomer Teoretisk databehandling kompleksitetsteori kompleksitet beregninger np-komplett |
| Sjanger | |
| Dewey | |
| ISBN | 9780521122542. - 9780521192484
|
