The Complexity of Problems for Quantified Constraints.
Michael BaulandElmar BöhlerNadia CreignouSteffen ReithHenning SchnoorHeribert VollmerPublished in: Theory Comput. Syst. (2010)
Keyphrases
- decision problems
- np complete
- constrained problems
- neural network
- polynomial hierarchy
- computational cost
- constraint satisfaction
- real time
- resource constraints
- partial solutions
- np hardness
- constraint programming
- solving constraint satisfaction problems
- constraint violations
- constraint sets
- global constraints
- computational complexity
- bayesian networks
- data mining
- data sets