1300 search results - page 36 / 260 » Constraint satisfaction problems and global cardinality cons... |
58
Voted
JACIII
2006
14 years 9 months ago
2006
53
Voted
CORR
2000
Springer
14 years 9 months ago
2000
Springer
CEC
2009
IEEE
14 years 7 months ago
2009
IEEE
SAT
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Many problems are naturally expressed using CNF clauses and boolean cardinality constraints. It is generally believed that solving such problems through pure CNF encoding...
59
Voted
DAGSTUHL
2006
14 years 11 months ago
2006
Abstract. The general intractability of the constraint satisfaction problem (CSP) has motivated the study of the complexity of restricted cases of this problem. Thus far, the liter...