749 search results - page 71 / 150 » Dualities for Constraint Satisfaction Problems |
62
Voted
ICALP
2010
Springer
15 years 3 months ago
2010
Springer
Min Ones Constraint Satisfaction Problems, i.e., the task of finding a satisfying assignment with at most k true variables (Min Ones SAT(Γ)), can express a number of interesting ...
106
click to vote
SIAMDM
2010
14 years 9 months ago
2010
For a fixed graph H, let Ret(H) denote the problem of deciding whether a given input graph is retractable to H. We classify the complexity of Ret(H) when H is a graph (with loops ...
CP
2003
Springer
15 years 4 months ago
2003
Springer
Abstract. Most previous theoretical study of the complexity of the constraint satisfaction problem has considered a simplified version of the problem in which all variables have t...
140
click to vote
FOCS
2002
IEEE
15 years 4 months ago
2002
IEEE
The Constraint Satisfaction Problem (CSP) provides a common framework for many combinatorial problems. The general CSP is known to be NP-complete; however, certain restrictions on...
ENDM
2000
14 years 11 months ago
2000
Both parametric design tasks and analysis tasks of technical systems have a similar problem setting: The structure of the system to be configured or analyzed is defined already. W...