Pages that link to "Item:Q1274280"

The following pages link to Constraints, consistency and closure (Q1274280):

Displaying 34 items.

• Majority constraints have bounded pathwidth duality (Q2427535) (← links)
• The existence of a near-unanimity function is decidable (Q2449447) (← links)
• The complexity of soft constraint satisfaction (Q2457608) (← links)
• Efficient interval partitioning-local search collaboration for constraint satisfaction (Q2459380) (← links)
• Combinatorial problems raised from 2-semilattices (Q2496183) (← links)
• Half-integrality, LP-branching, and FPT algorithms (Q2816829) (← links)
• On the CSP Dichotomy Conjecture (Q3007637) (← links)
• Nonnegative Weighted #CSP: An Effective Complexity Dichotomy (Q3179267) (← links)
• The Expressive Power of Binary Submodular Functions (Q3182971) (← links)
• The existence of a near-unanimity term in a finite algebra is decidable (Q3399189) (← links)
• The Expressive Power of Valued Constraints: Hierarchies and Collapses (Q3523088) (← links)
• On the minimality and global consistency of row-convex constraint networks (Q4369874) (← links)
• Closure properties of constraints (Q4376981) (← links)
• (Q4870741) (← links)
• On m-Junctive Predicates on a Finite Set (Q4973259) (← links)
• (Q4993594) (← links)
• Backdoor Sets for CSP. (Q4993598) (← links)
• Algebra and the Complexity of Digraph CSPs: a Survey (Q4993603) (← links)
• Quantified Constraints in Twenty Seventeen (Q4993605) (← links)
• Consistency for counting quantifiers (Q5005107) (← links)
• (Q5104706) (← 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)
• Program Development in Computational Logic (Q5712542) (← links)
• (Q5743434) (← links)
• Principles and Practice of Constraint Programming – CP 2004 (Q5900340) (← links)
• Deterministic enforcement of constraints (Q5930941) (← 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)
• Constraint reasoning (Q6602253) (← links)
• Graphs of finite algebras: maximality, rectangularity, and decomposition (Q6631352) (← links)