4524 search results - page 138 / 905 » The Complexity of Global Constraints |
111
Voted
DAGSTUHL
2006
15 years 2 months ago
2006
Abstract. The Galois connection involving polymorphisms and coclones has received a lot of attention in regard to constraint satisfaction problems. However, it fails if we are inte...
98
Voted
SIAMCOMP
2010
14 years 7 months ago
2010
An equality template (also equality constraint language) is a relational structure with infinite universe whose relations can be defined by boolean combinations of equalities. We ...
126
click to vote
LICS
2010
IEEE
14 years 10 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...
100
click to vote
RSA
2006
15 years 20 days 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 ...
144
Voted
LICS
2012
IEEE
13 years 3 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...