Hardness jumps in computational complexity?
Posted by Mohammad Al-Turkistany, at cstheory.stackexchange.com,
Minimum bandwidth problem is to a find an ordering of graph nodes on integer line that minimizes the largest distance between…
Complexity Theory: Exploring the Limits of Efficient Algorithms
Overview of attention for book
Table of Contents
-
Altmetric BadgeBook Overview
-
Altmetric BadgeChapter 1 Introduction
-
Altmetric BadgeChapter 2 Algorithmic Problems & Their Complexity
-
Altmetric BadgeChapter 3 Fundamental Complexity Classes
-
Altmetric BadgeChapter 4 Reductions — Algorithmic Relationships Between Problems
-
Altmetric BadgeChapter 5 The Theory of NP-Completeness
-
Altmetric BadgeChapter 6 NP-complete and NP-equivalent Problems
-
Altmetric BadgeChapter 7 The Complexity Analysis of Problems
-
Altmetric BadgeChapter 8 The Complexity of Approximation Problems — Classical Results
-
Altmetric BadgeChapter 9 The Complexity of Black Box Problems
-
Altmetric BadgeChapter 10 Additional Complexity Classes and Relationships Between Complexity Classes
-
Altmetric BadgeChapter 11 Interactive Proofs
-
Altmetric BadgeChapter 12 The PCP Theorem and the Complexity of Approximation Problems
-
Altmetric BadgeChapter 13 Further Topics From Classical Complexity Theory
-
Altmetric BadgeChapter 14 The Complexity of Non-uniform Problems
-
Altmetric BadgeChapter 15 Communication Complexity
-
Altmetric BadgeChapter 16 The Complexity of Boolean Functions