Computational complexity : a conceptual perspective /
Complexity theory is a central field of the theoretical foundations of computer science, concerned with the general study of the intrinsic complexity of computational tasks. This book offers a conceptual perspective on complexity theory intended to serve as an introduction for advanced undergraduate...
Clasificación: | Libro Electrónico |
---|---|
Autor principal: | |
Formato: | Electrónico eBook |
Idioma: | Inglés |
Publicado: |
Cambridge ; New York :
Cambridge University Press,
2008.
|
Temas: | |
Acceso en línea: | Texto completo |
Tabla de Contenidos:
- 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.