Precise Upper and Lower Bounds for the Monotone Constraint Satisfaction Problem.
Victor LagerkvistPublished in: MFCS (1) (2015)
Keyphrases
- upper and lower bounds
- constraint satisfaction problems
- upper bound
- constraint satisfaction
- lower bound
- constraint propagation
- constraint programming
- lower and upper bounds
- pseudo boolean optimization
- constraint solving
- search space
- np complete
- np hard
- arc consistency
- sample complexity
- partial constraint satisfaction
- non binary
- tractable subclasses
- decomposition methods
- worst case
- soft constraints
- constraint networks
- constraint graph
- branch and bound
- semi supervised
- constraint problems
- dnf formulas
- sample size
- generalization error
- temporal constraints