808 search results - page 3 / 162 » A scaling algorithm for polynomial constraint satisfaction p... |
STOC
2006
ACM
14 years 6 months ago
2006
ACM
CP
2008
Springer
13 years 7 months ago
2008
Springer
Submodular constraints play an important role both in theory and practice of valued constraint satisfaction problems (VCSPs). It has previously been shown, using results from the ...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
The constraint satisfaction problem (CSP) is a central generic problem in artificial intelligence. Considerable effort has been made in identifying properties which ensure tractabi...
IJCAI
1989
13 years 6 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...
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 ...