On the Complexity of Trial and Error for Constraint Satisfaction Problems.
Gábor IvanyosRaghav KulkarniYouming QiaoMiklos SanthaAarthi SundaramPublished in: ICALP (1) (2014)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- constraint programming
- arc consistency
- np complete
- constraint propagation
- non binary
- search space
- constraint solving
- decomposition methods
- space complexity
- np hard
- combinatorial problems
- computational problems
- finite domain
- product configuration
- forward checking
- constraint networks
- soft constraints
- global constraints
- computational complexity
- temporal reasoning
- constraint problems
- decision problems
- state space
- partial constraint satisfaction
- pseudo boolean optimization