Upper and Lower Bounds on the Time Complexity of Infinite-Domain CSPs.
Peter JonssonVictor LagerkvistPublished in: CP (2015)
Keyphrases
- upper and lower bounds
- upper bound
- lower bound
- constraint satisfaction problems
- worst case
- lower and upper bounds
- constraint satisfaction
- dnf formulas
- sample complexity
- data structure
- constraint programming
- tight upper and lower bounds
- constraint networks
- arc consistency
- space complexity
- constraint propagation
- data sets
- computational complexity
- training data