The following pages link to On Random Ordering Constraints (Q3392946):
Displaying 3 items.
- Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables (Q414863) (← links)
- Computational Short Cuts in Infinite Domain Constraint Satisfaction (Q5870497) (← links)
- On the descriptive complexity of temporal constraint satisfaction problems (Q6567262) (← links)
