749 search results - page 49 / 150 » Dualities for Constraint Satisfaction Problems |
CSR
2006
Springer
15 years 2 months ago
2006
Springer
We classify the computational complexity of all constraint satisfaction problems where the constraint language is preserved by all permutations of the domain. A constraint languag...
STACS
2009
Springer
15 years 5 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...
AAAI
2007
15 years 1 months ago
2007
Solving logic puzzles has become a very popular past-time, particularly since the Sudoku puzzle started appearing in newspapers all over the world. We have developed a puzzle gene...
CIE
2009
Springer
15 years 5 months ago
2009
Springer
Let Γ be a (not necessarily finite) structure with a finite relational signature. We prove that deciding whether a given existential positive sentence holds in Γ is in LOGSPACE...
TCOM
2011
14 years 5 months ago
2011
—Minimizing the sum of mean squared errors using linear transceivers under a sum power constraint in the multiuser downlink is a non-convex problem. Existing algorithms exploit a...