Dekorationsartikel gehören nicht zum Leistungsumfang.
Computational Complexity
Buch von Oded Goldreich
Sprache: Englisch

88,35 €*

inkl. MwSt.

Versandkostenfrei per Post / DHL

Lieferzeit 2-3 Wochen

Kategorien:
Beschreibung
A conceptual introduction to modern topics in complexity for advanced undergraduate and graduate students.
A conceptual introduction to modern topics in complexity for advanced undergraduate and graduate students.
Über den Autor
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.
Inhaltsverzeichnis
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.
Details
Erscheinungsjahr: 2015
Genre: Informatik
Rubrik: Naturwissenschaften & Technik
Medium: Buch
Seiten: 632
ISBN-13: 9780521884730
ISBN-10: 052188473X
Sprache: Englisch
Ausstattung / Beilage: HC gerader Rücken kaschiert
Einband: Gebunden
Autor: Goldreich, Oded
Hersteller: Cambridge University Press
Maße: 260 x 183 x 38 mm
Von/Mit: Oded Goldreich
Erscheinungsdatum: 13.01.2015
Gewicht: 1,368 kg
preigu-id: 101892278
Über den Autor
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.
Inhaltsverzeichnis
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.
Details
Erscheinungsjahr: 2015
Genre: Informatik
Rubrik: Naturwissenschaften & Technik
Medium: Buch
Seiten: 632
ISBN-13: 9780521884730
ISBN-10: 052188473X
Sprache: Englisch
Ausstattung / Beilage: HC gerader Rücken kaschiert
Einband: Gebunden
Autor: Goldreich, Oded
Hersteller: Cambridge University Press
Maße: 260 x 183 x 38 mm
Von/Mit: Oded Goldreich
Erscheinungsdatum: 13.01.2015
Gewicht: 1,368 kg
preigu-id: 101892278
Warnhinweis

Ähnliche Produkte

Ähnliche Produkte