↓ Skip to main content
What is this page? Embed badge

Complexity Theory: Exploring the Limits of Efficient Algorithms

Overview of attention for book
Cover of 'Complexity Theory: Exploring the Limits of Efficient Algorithms'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Introduction
  3. Altmetric Badge
    Chapter 2 Algorithmic Problems & Their Complexity
  4. Altmetric Badge
    Chapter 3 Fundamental Complexity Classes
  5. Altmetric Badge
    Chapter 4 Reductions — Algorithmic Relationships Between Problems
  6. Altmetric Badge
    Chapter 5 The Theory of NP-Completeness
  7. Altmetric Badge
    Chapter 6 NP-complete and NP-equivalent Problems
  8. Altmetric Badge
    Chapter 7 The Complexity Analysis of Problems
  9. Altmetric Badge
    Chapter 8 The Complexity of Approximation Problems — Classical Results
  10. Altmetric Badge
    Chapter 9 The Complexity of Black Box Problems
  11. Altmetric Badge
    Chapter 10 Additional Complexity Classes and Relationships Between Complexity Classes
  12. Altmetric Badge
    Chapter 11 Interactive Proofs
  13. Altmetric Badge
    Chapter 12 The PCP Theorem and the Complexity of Approximation Problems
  14. Altmetric Badge
    Chapter 13 Further Topics From Classical Complexity Theory
  15. Altmetric Badge
    Chapter 14 The Complexity of Non-uniform Problems
  16. Altmetric Badge
    Chapter 15 Communication Complexity
  17. Altmetric Badge
    Chapter 16 The Complexity of Boolean Functions
Attention for Chapter 2: Algorithmic Problems & Their Complexity
Altmetric Badge

Citations

dimensions_citation
53 Dimensions
Summary Dimensions citations
So far, Dimensions has found 53 publications that cite this research output.

53

The most recent citing publications are shown below. View all 53 publications that cite this research output on Dimensions.

This page shows the most recent citations of this research output.

Click here to find out how to access more activity.

This page is provided by Altmetric.