[Back]

I. Kanj, R. de Haan, St. Szeider:
"Subexponential Time Complexity of CSP with Global Constraints";
Talk: International Conference on Principles and Practice of Constraint Programming (CP), Lyon, France; 2014-09-08 - 2014-09-12; in: "CP 2014", LNCS / Springer, 8656 (2014), ISBN: 978-3-319-10427-0; 272 - 288.

Not all NP-complete problems share the same practical hardness with respect to exact computation. Whereas some NP-complete problems are amenable to efficient computational methods, others are yet to show any such sign. It becomes a major challenge to develop a theoretical framework that is more fine-grained than the theory of NP-completeness, and that can explain the distinction between the exact complexities of various NP-complete problems. This distinction is highly relevant for constraint satisfaction problems under natural restrictions, where various shades of hardness can be observed in practice.

Acknowledging the NP-hardness of such problems, one has to look beyond polynomial time computation. The theory of subexponential time complexity provides such a framework, and has been enjoying increasing popularity in complexity theory. Recently, a first analysis of the subexponential time complexity of classical CSPs (where all constraints are given extensionally as tables) was given.

In this paper, we extend this analysis to CSPs in which constraints are given intensionally in the form of global constraints. In particular, we consider CSPs that use the fundamental global constraints AllDifferent, AtLeastNValue, AtMost- NValue, and constraints that are specified by compressed tuples (cTable). We provide tight characterizations of the subexponential time complexity of the aforementioned problems with respect to several natural structural parameters.

Project Head Stefan Szeider:
Parameterized Compilation

Project Head Stefan Szeider:
The Parameterized Complexity of Reasoning Problems