105 search results - page 2 / 21 » Some Applications of Graph Bandwidth to Constraint Satisfact... |
AAAI
1998
14 years 10 months ago
1998
It is well known that any non-binary discrete constraint satisfaction problem (CSP) can be translated into an equivalent binary CSP. Two translations are known: the dual graph tra...
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...
JGO
2008
14 years 9 months ago
2008
Abstract. Good scaling is an essential requirement for the good behavior of many numerical algorithms. In particular, for problems involving multivariate polynomials, a change of s...
CSR
2009
Springer
14 years 10 months ago
2009
Springer
We study the approximability of the maximum solution problem. This problem is an optimisation variant of the constraint satisfaction problem and it captures a wide range of interes...
AAAI
2004
14 years 10 months ago
2004
We study local interchangeability of values in constraint networks based on a new approach where a single value in the domain of a variable can be treated as a combination of &quo...