Computational complexity a conceptual perspective
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 comput...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Cambridge
Cambridge University Press
2008
|
| Schlagworte: | |
| Online-Zugang: | BSB01 FHN01 UBY01 UER01 URL des Erstveröffentlichers |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Inhaltsangabe:
- 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