Computational complexity

Computational complexity

by Papadimitriou, Christos H.

Type Book
Rate 0.0 /5
Details
Files
Reviews
Download

Title Statements

  • Full title :Computational complexity / Christos H. Papadimitriou.

Edition Statements

  • Publication Date:©1994.

Publication Statements

  • Publisher(s):Addison-Wesley
  • Place of Publication:Reading, Mass
  • Language:eng
  • Publication Date:©1994.

The Physical Object

  • Description:xv, 523 pages : : illustrations ; : 25 cm

Edition Identifiers

  • ISBN:0201530821, 9780201530827, 0020153082, 9780020153085
  • oclc:ocm28421912
  • LC Classification:QA267.7
  • Dewey Decimal:511.3

Table of Contents

pt. I. Algorithms. 1. Problems and Algorithms. 2. Turing machines. 3. Computability -- pt. II. Logic. 4. Boolean logic. 5. First-order logic. 6. Undecidability in logic -- pt. III. P and NP. 7. Relations between complexity classes. 8. Reductions and completeness. 9. NP-complete problems. 10. coNP and function problems. 11. Randomized computation. 12. Cryptography. 13. Approximability. 14. On P vs. NP -- pt. IV. Inside P. 15. Parallel computation. 16. Logarithmic space -- pt. V. Beyond NP. 17. The polynomial hierarchy. 18. Computation that counts. 19. Polynomial space. 20. A glimpse beyond.

Read More ↓

Subjects

algoritmen Complexité de calcul (Informatique) Complexiteit Computational complexity

Writers

Papadimitriou, Christos H.

Rate & Review

0.0/5
(0 people Voted)

No reviews yet. Be the first to rate this work.

Files & Downloads

  • Computational Complexity -- (.djvu)

    DJVU · 4.5 MB · updated
    Login →

  • Computational Complexity -- (.djvu)

    DJVU · 4.7 MB · updated
    Login →

  • Computational Complexity -- (.pdf)

    PDF · 45.6 MB · updated
    Login →