AMS eBook CollectionsOne of the world's most respected mathematical collections, available in digital format for your library or institution
Computational Complexity Theory
About this Title
Steven Rudich, Carnegie Mellon University, Pittsburgh, PA and Avi Wigderson, Institute for Advanced Study, Princeton, NJ, Editors
Publication: IAS/Park City Mathematics Series
Publication Year:
2004; Volume 10
ISBNs: 978-0-8218-2872-4 (print); 978-1-4704-3909-5 (online)
DOI: https://doi.org/10.1090/pcms/010
MathSciNet review: MR2090724
MSC: Primary 68Q15; Secondary 03D15, 03F20, 68-02, 68-06, 68Q17, 81P68
Table of Contents
Front/Back Matter
Chapters
Week One: Complexity theory: From Gödel to Feynman
- Complexity theory: From Gödel to Feynman
- Average case complexity
- Exploring complexity through reductions
- Quantum computation
Week Two: Lower Bounds
Week Three: Randomness in computation