There has been a common perception that computational complexity is a theory of "bad news" because its most ty
560 109 2MB
English Pages 1-340 [350] Year 2004
Table of contents :
Content:
Preface
Pages vii-ix
Marius Zimand
Chapter 1 Preliminaries Original Research Article
Pages 1-23
Chapter 2 Abstract complexity theory Original Research Article
Pages 25-50
Chapter 3 Polynomial time, nondeterministic polynomial time, and exponential time Original Research Article
Pages 51-108
Chapter 4 Quantum computation Original Research Article
Pages 109-141
Chapter 5 One-way functions and pseudo-random generators Original Research Article
Pages 143-224
Chapter 6 Optimization problems Original Research Article
Pages 225-316
Appendix A Tail bounds
Pages 317-320
Bibliography
Pages 321-332
Index
Pages 333-340