15 search results - page 1 / 3 » A combinatorial constraint satisfaction problem dichotomy cl... |
64
Voted
EJC
2010
14 years 9 months ago
2010
We further generalise a construction
MFCS
2007
Springer
15 years 3 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...
96
Voted
ICALP
2007
Springer
15 years 3 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...
100
click to vote
STACS
2010
Springer
15 years 2 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...
134
click to vote
FOCS
2002
IEEE
15 years 2 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...