Computational complexity : a conceptual perspective / Oded Goldreich.

Author/creator Goldreich, Oded
Format Book
Publication InfoCambridge ; New York : Cambridge University Press, 2008.
Descriptionxxiv, 606 pages : illustrations ; 27 cm
Supplemental ContentContributor biographical information
Supplemental ContentPublisher description
Supplemental ContentTable of contents only
Subjects

Contents Introduction and preliminaries -- P, NP and NP-completeness -- Variations on P and NP -- More resources, more power -- Space complexity -- Randomness and counting -- The bright side of hardness -- Pseudorandom generators -- Probabilistic proof systems -- Relaxing the requirements -- 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.
Bibliography noteIncludes bibliographical references (p. 589-599) and index.
LCCN 2008006750
ISBN9780521884730 (hardback)
ISBN052188473X (hardback)

Availability

Library Location Call Number Status Item Actions
Joyner General Stacks QA267.7 .G65 2008 ✔ Available Place Hold