Lower Bounds for non-Boolean Constraint Satisfaction
Lars EngebretsenPublished in: Electron. Colloquium Comput. Complex. (2000)
Keyphrases
- constraint satisfaction
- lower bound
- upper bound
- constraint satisfaction problems
- np hard
- branch and bound
- branch and bound algorithm
- phase transition
- heuristic search
- constraint programming
- objective function
- boolean functions
- relaxation labeling
- lower and upper bounds
- constraint propagation
- constraint relaxation
- product configuration
- russian doll search
- optimal solution
- probabilistic reasoning
- worst case
- arc consistency
- lagrangian relaxation
- max sat
- robust fault detection
- constraint solving
- constrained problems
- soft constraints
- sat solvers
- search strategies
- constraint optimization
- expert systems