Oded Goldreich

Computational Complexity (eBook, PDF)

A Conceptual Perspective

• Format: PDF

Produktbeschreibung

Complexity theory is a central field of the theoretical foundations of computer science. It is concerned with the general study of the intrinsic complexity of computational tasks; that is, it addresses the question of what can be achieved within limited time (and/or with other limited natural computational resources). This book offers a conceptual perspective on complexity theory. It is intended to serve as an introduction for advanced undergraduate and graduate students, either as a textbook or for self-study. The book will also be useful to experts, since it provides expositions of the various sub-areas of complexity theory such as hardness amplification, pseudorandomness and probabilistic proof systems. In each case, the author starts by posing the intuitive questions that are addressed by the sub-area and then discusses the choices made in the actual formulation of these questions, the approaches that lead to the answers, and the ideas that are embedded in these answers.

---

Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.

Produktdetails

• Verlag: Cambridge University Press
• Erscheinungstermin: 28. April 2008
• Englisch
• ISBN-13: 9780511402685
• Artikelnr.: 38185387

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.