2005

Complexity Theory

Exploring the Limits of Efficient Algorithms

Authors:

ISBN: 978-3-540-21045-0 (Print) 978-3-540-27477-3 (Online)

Table of contents (16 chapters)

  1. Front Matter

    Pages I-XI

  2. No Access

    Book Chapter

    Pages 1-10

    Introduction

  3. No Access

    Book Chapter

    Pages 11-24

    Algorithmic Problems & Their Complexity

  4. No Access

    Book Chapter

    Pages 25-41

    Fundamental Complexity Classes

  5. No Access

    Book Chapter

    Pages 43-61

    Reductions — Algorithmic Relationships Between Problems

  6. No Access

    Book Chapter

    Pages 63-75

    The Theory of NP-Completeness

  7. No Access

    Book Chapter

    Pages 77-87

    NP-complete and NP-equivalent Problems

  8. No Access

    Book Chapter

    Pages 89-97

    The Complexity Analysis of Problems

  9. No Access

    Book Chapter

    Pages 99-114

    The Complexity of Approximation Problems — Classical Results

  10. No Access

    Book Chapter

    Pages 115-125

    The Complexity of Black Box Problems

  11. No Access

    Book Chapter

    Pages 127-144

    Additional Complexity Classes and Relationships Between Complexity Classes

  12. No Access

    Book Chapter

    Pages 145-159

    Interactive Proofs

  13. No Access

    Book Chapter

    Pages 161-184

    The PCP Theorem and the Complexity of Approximation Problems

  14. No Access

    Book Chapter

    Pages 185-199

    Further Topics From Classical Complexity Theory

  15. No Access

    Book Chapter

    Pages 201-217

    The Complexity of Non-uniform Problems

  16. No Access

    Book Chapter

    Pages 219-249

    Communication Complexity

  17. No Access

    Book Chapter

    Pages 251-275

    The Complexity of Boolean Functions

  18. Back Matter

    Pages 277-308