Computational Complexity: A Conceptual Perspective / Edition 1

Computational Complexity: A Conceptual Perspective / Edition 1

by Oded Goldreich
     
 

ISBN-10: 052188473X

ISBN-13: 9780521884730

Pub. Date: 05/28/2008

Publisher: Cambridge University Press

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

…  See more details below

Overview

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.

Product Details

ISBN-13:
9780521884730
Publisher:
Cambridge University Press
Publication date:
05/28/2008
Edition description:
New Edition
Pages:
632
Sales rank:
1,068,237
Product dimensions:
7.20(w) x 10.10(h) x 1.50(d)

Table of Contents

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.

Customer Reviews

Average Review:

Write a Review

and post it to your social network

     

Most Helpful Customer Reviews

See all customer reviews >