no code implementations • 10 Jul 2013 • David A. Cohen, Peter G. Jeavons, Evgenij Thorstensen, Stanislav Živný
We study the complexity of constraint satisfaction problems involving global constraints, i. e., special-purpose constraints provided by a solver and represented implicitly by a parametrised algorithm.
