15 search results - page 1 / 3 » A combinatorial constraint satisfaction problem dichotomy cl... |
79
Voted
EJC
2010
15 years 1 months ago
2010
We further generalise a construction
107
Voted
MFCS
2007
Springer
15 years 7 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...
124
Voted
ICALP
2007
Springer
15 years 7 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...
129
Voted
STACS
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. In the constraint satisfaction problem (CSP), the aim is to find an assignment of values to a set of variables subject to specified constraints. In the minimum cost hom...
160
Voted
FOCS
2002
IEEE
15 years 6 months ago
2002
IEEE
The Constraint Satisfaction Problem (CSP) provides a common framework for many combinatorial problems. The general CSP is known to be NP-complete; however, certain restrictions on...