4 search results - page 1 / 1 » On the Scope of the Universal-Algebraic Approach to Constrai... |
LICS
2010
IEEE
13 years 2 months ago
2010
IEEE
The universal-algebraic approach has proved a powerful tool in the study of the computational complexity of constraint satisfaction problems (CSPs). This approach has previously b...
SIAMDM
2010
13 years 2 months ago
2010
For a fixed graph H, let Ret(H) denote the problem of deciding whether a given input graph is retractable to H. We classify the complexity of Ret(H) when H is a graph (with loops ...
MFCS
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. We introduce a new general polynomial-time constructionthe fibre construction- which reduces any constraint satisfaction problem CSP(H) to the constraint satisfaction pr...
SAT
2004
Springer
13 years 10 months ago
2004
Springer
Kolaitis and Vardi pointed out that constraint satisfaction and conjunctive query containment are essentially the same problem. We study the Boolean conjunctive queries under a mor...