43 search results - page 1 / 9 » A unified theory of structural tractability for constraint s... |
JCSS
2008
13 years 4 months ago
2008
In this paper we derive a generic form of structural decomposition for the constraint satisfaction problem, which we call a guarded decomposition. We show that many existing decom...
FOCS
2003
IEEE
13 years 9 months ago
2003
IEEE
We give a complexity theoretic classification of homomorphism problems for graphs and, more generally, relational structures obtained by restricting the left hand side structure ...
AAAI
2004
13 years 6 months ago
2004
The concept of consistency has pervaded studies of the constraint satisfaction problem. We introduce two concepts, which are inspired by consistency, for the more general framewor...
CP
2008
Springer
13 years 6 months ago
2008
Springer
By using recent results from graph theory, including the Strong Perfect Graph Theorem, we obtain a unifying framework for a number of tractable classes of constraint problems. Thes...
ICALP
2007
Springer
13 years 10 months ago
2007
Springer
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...