Pages that link to "Item:Q1274280"
From MaRDI portal
The following pages link to Constraints, consistency and closure (Q1274280):
Displaying 50 items.
- Tractability in constraint satisfaction problems: a survey (Q271997) (← links)
- Dualities and algebras with a near-unanimity term (Q312213) (← links)
- Preserving near unanimity terms under products (Q331032) (← links)
- Belief revision within fragments of propositional logic (Q386044) (← links)
- Key (critical) relations preserved by a weak near-unanimity function (Q522228) (← links)
- Gap theorems for robust satisfiability: Boolean CSPs and beyond (Q527405) (← links)
- Classes of submodular constraints expressible by graph cuts (Q606899) (← links)
- On the expression complexity of equivalence and isomorphism of primitive positive formulas (Q692919) (← links)
- A polynomial relational class of binary CSP (Q722101) (← links)
- Backdoors into heterogeneous classes of SAT and CSP (Q730498) (← links)
- On weak positive predicates over a finite set (Q783121) (← links)
- The expressive rate of constraints (Q812391) (← links)
- Periodic constraint satisfaction problems: Tractable subclasses (Q816674) (← links)
- \(H\)-coloring dichotomy revisited (Q817769) (← links)
- The complexity of constraint satisfaction games and QCSP (Q840700) (← links)
- Towards a dichotomy theorem for the counting constraint satisfaction problem (Q879594) (← links)
- Conservative constraint satisfaction re-revisited (Q896026) (← links)
- A new line of attack on the dichotomy conjecture (Q896081) (← links)
- Generalising submodularity and Horn clauses: Tractable optimization problems defined by tournament pair multimorphisms (Q935141) (← links)
- The expressive power of valued constraints: Hierarchies and collapses (Q959827) (← links)
- The expressive power of binary submodular functions (Q967393) (← links)
- Existentially restricted quantified constraint satisfaction (Q1013082) (← links)
- Minimization of locally defined submodular functions by optimal soft arc consistency (Q1020491) (← links)
- Relatively quantified constraint satisfaction (Q1020500) (← links)
- Learnability of quantified formulas. (Q1426470) (← links)
- Constraint propagation techniques for the disjunctive scheduling problem (Q1583518) (← links)
- An efficient algorithm for a class of constraint satisfaction problems (Q1611994) (← links)
- On tree-preserving constraints (Q1688715) (← links)
- On bijunctive predicates over a finite set (Q1741483) (← links)
- Finding a given number of solutions to a system of fuzzy constraints (Q1745696) (← links)
- A new tractable class of constraint satisfaction problems (Q1776199) (← links)
- Constraint satisfaction with succinctly specified relations (Q1959431) (← links)
- Tractable combinations of theories via sampling (Q2055788) (← links)
- A quasi-Mal'cev condition with unexpected application. (Q2351514) (← links)
- Learning intersection-closed classes with signatures (Q2381578) (← links)
- Domain permutation reduction for constraint satisfaction problems (Q2389649) (← links)
- Properties of tree convex constraints (Q2389670) (← links)
- On planar valued CSPs (Q2396724) (← links)
- 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)
- (Q4993594) (← links)
- Backdoor Sets for CSP. (Q4993598) (← links)
