Computational complexity : a conceptual perspective - Goldreich, Oded (Cambridge : Cambridge University Press, 2008)
1. Introduction and preliminaries -- 2. P, NP and NP-completeness -- 3. Variations on P and NP -- 4. More resources, more power? -- 5. Space complexity -- 6. Randomness and counting -- 7. The bright side of hardness -- 8. Pseudorandom generators -- 9. Probabiistic proof systems -- 10. Relaxing the requirements -- Epilogue -- A. Glossary of complexity classes -- B. On the quest for lower bounds -- C. On the foundations of modern cryptography -- D. Probabilistic preliminaries and advanced topics in randomization -- E. Explicit constructions -- F. Some omitted proofs -- G. Some computational problems.
Incluye índice y bibliografía.
Keywords: COMPLEJIDAD COMPUTACIONAL