Oded Goldreich

P, NP, and NP-Completeness

• Gebundenes Buch

Produktbeschreibung

Starting from the basics of computability, this undergraduate introduction focuses on the P versus NP Question and the theory of NP-completeness.

---

Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.

Produktdetails

• Verlag: Cambridge University Press
• Seitenzahl: 216
• Erscheinungstermin: 26. August 2015
• Englisch
• Abmessung: 235mm x 157mm x 17mm
• Gewicht: 508g
• ISBN-13: 9780521192484
• ISBN-10: 052119248X
• Artikelnr.: 30518648

Autorenporträt

Oded 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.

Inhaltsangabe

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.

---

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.

Rezensionen

'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