TY  - BOOK
AU  - Papadimitriou,Christos H.
TI  - Computational complexity
SN  - 0201530821
PY  - 1995///
CY  - Reading
PB  - [S.n.]
KW  - COMPLEJIDAD COMPUTACIONAL
N1  -  Part I. Algorithms. 1. Problems and algorithms -- 2. Turing machines -- 3. Computability -- Part II. Logic. 4. Boolean logic -- 5. First-order logic -- 6. Undecidability in logic -- Part III. P and NP. 7. Relations between complexity classes -- 8. Reductions and completeness -- 9. NP-complete problems -- 10. coNP and fuction problems -- 11. Randomized computation -- 12. Cryptography -- 13. Approximability -- 14. One P vs NP -- Part IV. Inside P. 15. Parallel computation -- 16. Logarithmic space -- Part V. Beyond NP. 18. Computation that counts -- 19. Polynomial space -- 20. A glimpse beyond
ER  -