Computational Complexity
eBook - PDF

Computational Complexity

A Conceptual Perspective

  1. English
  2. PDF
  3. Available on iOS & Android
eBook - PDF

Computational Complexity

A Conceptual Perspective

About this book

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.

Frequently asked questions

Yes, you can cancel anytime from the Subscription tab in your account settings on the Perlego website. Your subscription will stay active until the end of your current billing period. Learn how to cancel your subscription.
At the moment all of our mobile-responsive ePub books are available to download via the app. Most of our PDFs are also available to download and we're working on making the final remaining ones downloadable now. Learn more here.
Perlego offers two plans: Essential and Complete
  • Essential is ideal for learners and professionals who enjoy exploring a wide range of subjects. Access the Essential Library with 800,000+ trusted titles and best-sellers across business, personal growth, and the humanities. Includes unlimited reading time and Standard Read Aloud voice.
  • Complete: Perfect for advanced learners and researchers needing full, unrestricted access. Unlock 1.4M+ books across hundreds of subjects, including academic and specialized titles. The Complete Plan also includes advanced features like Premium Read Aloud and Research Assistant.
Both plans are available with monthly, semester, or annual billing cycles.
We are an online textbook subscription service, where you can get access to an entire online library for less than the price of a single book per month. With over 1 million books across 1000+ topics, we’ve got you covered! Learn more here.
Look out for the read-aloud symbol on your next book to see if you can listen to it. The read-aloud tool reads text aloud for you, highlighting the text as it is being read. You can pause it, speed it up and slow it down. Learn more here.
Yes! You can use the Perlego app on both iOS or Android devices to read anytime, anywhere — even offline. Perfect for commutes or when you’re on the go.
Please note we cannot support devices running on iOS 13 and Android 7 or earlier. Learn more about using the app.
Yes, you can access Computational Complexity by Oded Goldreich in PDF and/or ePUB format, as well as other popular books in Computer Science & Computer Science General. We have over one million books available in our catalogue for you to explore.

Table of contents

  1. Cover
  2. Half-title
  3. Title
  4. Copyright
  5. Dedication
  6. Contents
  7. List of Figures
  8. Preface
  9. Organization and Chapter Summaries
  10. Acknowledgments
  11. Charptr 1 Introduction and Preliminaries
  12. Chapter 2 P, NP, and NP-Completeness
  13. Chapter 3 Variations on P and NP
  14. Chapter 4 More Resources, More Power?
  15. Chapter 5 Space Complexity
  16. Chapter 6 Randomness and Counting
  17. Chapter 7 The Bright Side of Hardness
  18. Chapter 8 Pseudorandom Generators
  19. Chapter 9 Probabilistic Proof Systems
  20. Chapter 10 Relaxing the Requirements
  21. Epilogue
  22. Appendix A Glossary of Complexity Classes
  23. Appendix B On the Quest for Lower Bounds
  24. Appendix C On the Foundations of Modern Cryptography
  25. Appendix D Probabilistic Preliminaries and Advanced Topics in Randomization
  26. Appendix E Explicit Constructions
  27. Appendix F Some Omitted Proofs
  28. Appendix G Some Computational Problems
  29. Bibliography
  30. Index