Oded Goldreich (Israel Weizmann Institute of Science)

Computational Complexity

• Gebundenes Buch

Produktbeschreibung

A conceptual introduction to the study of the intrinsic complexity of computational tasks. It will serve advanced undergraduate and graduate students, either as a textbook or for self-study. It provides explanations of the various sub-areas of complexity theory such as hardness amplification, pseudorandomness, and probabilistic proof systems.

---

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

Produktdetails

• Verlag: Cambridge University Press
• Seitenzahl: 632
• Erscheinungstermin: 13. Januar 2015
• Englisch
• Abmessung: 260mm x 183mm x 38mm
• Gewicht: 1342g
• ISBN-13: 9780521884730
• ISBN-10: 052188473X
• Artikelnr.: 23367140

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, Probabalistic Proofs and Pseudorandomness and the two-volume work Foundations of Cryptography.

Inhaltsangabe

1. Introduction and preliminaries
2. P, NP and NP-completeness
3. Variations on P and NP
4. More resources, more power?
5. Space complexity
6. Randomness and counting
7. The bright side of hardness
8. Pseudorandom generators
9. Probabilistic proof systems
10. Relaxing the requirements
Epilogue
Appendix A. Glossary of complexity classes
Appendix B. On the quest for lower bounds
Appendix C. On the foundations of modern cryptography
Appendix D. Probabilistic preliminaries and advanced topics in randomization
Appendix E. Explicit constructions
Appendix F. Some omitted proofs
Appendix G. Some computational problems.