Pages that link to "Item:Q1274280"
From MaRDI portal
The following pages link to Constraints, consistency and closure (Q1274280):
Displaying 11 items.
- Algebra and the Complexity of Digraph CSPs: a Survey (Q4993603) (← links)
- Quantified Constraints in Twenty Seventeen (Q4993605) (← links)
- (Q5005107) (← links)
- Robust Algorithms with Polynomial Loss for Near-Unanimity CSPs (Q5203794) (← links)
- Constant-Query Testability of Assignments to Constraint Satisfaction Problems (Q5232319) (← links)
- TAYLOR TERMS, CONSTRAINT SATISFACTION AND THE COMPLEXITY OF POLYNOMIAL EQUATIONS OVER FINITE ALGEBRAS (Q5483456) (← links)
- Recent Results on the Algebraic Approach to the CSP (Q5504700) (← links)
- Dualities for Constraint Satisfaction Problems (Q5504701) (← links)
- (Q5743434) (← links)
- The algebraic structure of the densification and the sparsification tasks for CSPs (Q6080503) (← links)
- Constraint satisfaction problem: what makes the problem easy (Q6119674) (← links)
