113 search results - page 5 / 23 » On bounded occurrence constraint satisfaction |
STACS
2009
Springer
14 years 2 months ago
2009
Springer
The way the graph structure of the constraints influences the complexity of constraint satisfaction problems (CSP) is well understood for bounded-arity constraints. The situation...
RSA
2006
13 years 7 months ago
2006
Abstract. We study two natural models of randomly generated constraint satisfaction problems. We determine how quickly the domain size must grow with n to ensure that these models ...
LICS
2012
IEEE
11 years 10 months ago
2012
IEEE
—We show that if a finite relational structure has a near unanimity polymorphism, then the constraint satisfaction problem with that structure as its fixed template has bounded...
AAAI
2006
13 years 9 months ago
2006
Set variables are ubiquitous in modeling (soft) constraint problems, but efforts on practical consistency algorithms for Weighted Constraint Satisfaction Problems (WCSPs) have onl...
IJCAI
1989
13 years 8 months ago
1989
A constraint satisfaction problem, or CSP, can be reformulated as an integer linear programming problem. The reformulated problem can be solved via polynomial multiplication. If t...