P, NP, and NP-Completeness
The Basics of Computational Complexity
(Sprache: Englisch)
Starting from the basics of computability, this undergraduate introduction focuses on the P versus NP Question and the theory of NP-completeness.
Leider schon ausverkauft
versandkostenfrei
Buch
46.90 €
23 DeutschlandCard Punkte
sammeln
- Lastschrift, Kreditkarte, Paypal, Rechnung
- Kostenlose Rücksendung
Produktdetails
Produktinformationen zu „P, NP, and NP-Completeness “
Starting from the basics of computability, this undergraduate introduction focuses on the P versus NP Question and the theory of NP-completeness.
Klappentext zu „P, NP, and NP-Completeness “
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 harder than verifying their correctness. It is widely believed that the answer to these equivalent formulations is positive, and this is captured by saying that P is different from NP. Although the P versus NP Question remains unresolved, the theory of NP-completeness offers evidence for the intractability of specific problems in NP by showing that they are universal for the entire class. Amazingly enough, NP-complete problems exist, and furthermore hundreds of natural computational problems arising in many different areas of mathematics and science are NP-complete.
Inhaltsverzeichnis zu „P, NP, and NP-Completeness “
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.
Autoren-Porträt von Oded Goldreich
Goldreich, OdedOded Goldreich is a Professor of Computer Science at the Weizmann Institute of Science and an incumbent of the Meyer W. Weisgal Professorial Chair. He is an editor for the SIAM Journal on Computing, the Journal of Cryptology, and Computational Complexity and previously authored the books Modern Cryptography, Probabilistic Proofs and Pseudorandomness, the two-volume work Foundations of Cryptography, and Computational Complexity: A Conceptual Perspective.
Bibliographische Angaben
- Autor: Oded Goldreich
- 216 Seiten, mit Abbildungen, Maße: 15,2 x 22,9 cm, Kartoniert (TB), Englisch
- Verlag: Cambridge University Press
- ISBN-10: 0521122546
- ISBN-13: 9780521122542
- Erscheinungsdatum: 01.08.2010
Sprache:
Englisch
Rezension zu „P, NP, and NP-Completeness “
'The author is a well-known expert in the field of complexity theory and so is well-qualified to bring out this book which will serve as a very good introductory textbook. The focus on search problems and promise problems in this book is to be appreciated since many books neglect these topics.' S. V. Naaraj, SIGACT News
Kommentar zu "P, NP, and NP-Completeness"
0 Gebrauchte Artikel zu „P, NP, and NP-Completeness“
| Zustand | Preis | Porto | Zahlung | Verkäufer | Rating |
|---|
Schreiben Sie einen Kommentar zu "P, NP, and NP-Completeness".
Kommentar verfassen