380 search results - page 4 / 76 » Cluster Graphs as Abstractions for Constraint Satisfaction P... |
CORR
2007
Springer
13 years 5 months ago
2007
Springer
We present an exactly solvable random-subcube model inspired by the structure of hard constraint satisfaction and optimization problems. Our model reproduces the structure of the s...
LICS
2008
IEEE
14 years 5 days ago
2008
IEEE
The study of constraint satisfaction problems definable in various fragments of Datalog has recently gained considerable importance. We consider constraint satisfaction problems ...
AMAI
2004
Springer
13 years 11 months ago
2004
Springer
In this paper the use of graph isomorphism is investigated within the framework of symmetry breaking in constraint satisfaction problems. A running example of Comma-free codes is ...
CSL
2009
Springer
14 years 11 days ago
2009
Springer
Abstract. We define an abstract pebble game that provides game interpretations for essentially all known consistency algorithms for constraint satisfaction problems including arc-...
FOCS
2003
IEEE
13 years 11 months ago
2003
IEEE
We give a complexity theoretic classification of homomorphism problems for graphs and, more generally, relational structures obtained by restricting the left hand side structure ...