ShopSpell

Computational Complexity A Conceptual Perspective [Hardcover]

$100.99       (Free Shipping)
93 available
  • Category: Books (Computers)
  • Author:  Goldreich, Oded
  • Author:  Goldreich, Oded
  • ISBN-10:  052188473X
  • ISBN-10:  052188473X
  • ISBN-13:  9780521884730
  • ISBN-13:  9780521884730
  • Publisher:  Cambridge University Press
  • Publisher:  Cambridge University Press
  • Pages:  632
  • Pages:  632
  • Binding:  Hardcover
  • Binding:  Hardcover
  • Pub Date:  01-May-2008
  • Pub Date:  01-May-2008
  • SKU:  052188473X-11-MPOD
  • SKU:  052188473X-11-MPOD
  • Item ID: 100176422
  • Seller: ShopSpell
  • Ships in: 2 business days
  • Transit time: Up to 5 business days
  • Delivery by: Jan 20 to Jan 22
  • Notes: Brand New Book. Order Now.
A conceptual introduction to modern topics in complexity for advanced undergraduate and graduate students.This book offers a conceptual introduction to the study of the intrinsic complexity of computational tasks. It is intended to serve advanced undergraduate and graduate students, either as a textbook or for self-study. It is also useful to experts, since it provides expositions of the various sub-areas of complexity theory such as hardness amplification, pseudorandomness, and probabilistic proof systems.This book offers a conceptual introduction to the study of the intrinsic complexity of computational tasks. It is intended to serve advanced undergraduate and graduate students, either as a textbook or for self-study. It is also useful to experts, since it provides expositions of the various sub-areas of complexity theory such as hardness amplification, pseudorandomness, and probabilistic proof systems.This book offers a comprehensive perspective to modern topics in complexity theory, which is a central field of the theoretical foundations of computer science. It addresses the looming question of what can be achieved within a limited amount of time with or without other limited natural computational resources. Can be used as an introduction for advanced undergraduate and graduate students as either a textbook or for self-study, or to experts, since it provides expositions of the various sub-areas of complexity theory such as hardness amplification, pseudorandomness and probabilistic proof systems.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. ProbabilistlC)
Add Review