Local cover image
Local cover image

Computational complexity

By: Material type: TextTextPublication details: Reading : [S.n.], 1995Edition: Repr. with corr. edDescription: xv, 523 p. : il. ; 24 cmISBN:
  • 0201530821
Subject(s):
Contents:
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.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Home library Call number Status Date due Barcode
Libro Libro Biblioteca de la Facultad de Informática F.2 PAP (Browse shelf(Opens below)) Available DIF-02888

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.

Click on an image to view it in the image viewer

Local cover image