Complexity Cores and Hard Problem Instances

Many intractable problems such as NP-complete problems (provided P = NP) have easy subproblems. In contrast, we investigate the existence and the properties of inherently hard subproblems, called complexity cores. Furthermore, the question is posed whether individual problem instances can be inherently hard (for all algorithms solving the problem), and this question is answered positively.

• Type: Conference
• Year: 1990
• Where: SIGAL
• Authors: Uwe Schöning
• Keywords: Algorithms, Individual Problem Instances, Many Intractable Problems, NP-complete Problems, SIGAL 1990