Pages that link to "Item:Q5504701"
From MaRDI portal
The following pages link to Dualities for Constraint Satisfaction Problems (Q5504701):
Displaying 32 items.
- Tractability in constraint satisfaction problems: a survey (Q271997) (← links)
- List-homomorphism problems on graphs and arc consistency (Q393914) (← links)
- Colouring, constraint satisfaction, and complexity (Q458466) (← links)
- Boolean topological graphs of semigroups: the lack of first-order axiomatization (Q485412) (← links)
- Quasi-equational bases for graphs of semigroups, monoids and groups. (Q535220) (← links)
- Regular families of forests, antichains and duality pairs of relational structures (Q681598) (← links)
- The complexity of the list homomorphism problem for graphs (Q693060) (← links)
- There are no pure relational width 2 constraint satisfaction problems (Q976077) (← links)
- CSP duality and trees of bounded pathwidth (Q986555) (← links)
- A complete classification of the complexity and rewritability of ontology-mediated queries based on the description logic \(\mathcal{EL}\) (Q2144172) (← links)
- Dismantlability, connectedness, and mixing in relational structures (Q2222042) (← links)
- On Maltsev digraphs (Q2260621) (← links)
- Constraint satisfaction problems over semilattice block Mal'tsev algebras (Q2272992) (← links)
- Graph partitions with prescribed patterns (Q2509761) (← links)
- Robustly Solvable Constraint Satisfaction Problems (Q2817797) (← links)
- On algebras with many symmetric operations (Q2821826) (← links)
- On Maltsev Digraphs (Q3007626) (← links)
- On the CSP Dichotomy Conjecture (Q3007637) (← links)
- Constraint Satisfaction Problems Solvable by Local Consistency Methods (Q3189638) (← links)
- OMITTING TYPES, BOUNDED WIDTH AND THE ABILITY TO COUNT (Q3398315) (← links)
- NU Polymorphisms on Reflexive Digraphs (Q4610183) (← links)
- (Q4643956) (← links)
- (Q4993594) (← links)
- Algebra and the Complexity of Digraph CSPs: a Survey (Q4993603) (← links)
- Solving CSPs Using Weak Local Consistency (Q5009788) (← links)
- Dismantlability, Connectedness, and Mixing in Relational Structures (Q5091178) (← links)
- Robust Algorithms with Polynomial Loss for Near-Unanimity CSPs (Q5203794) (← links)
- (Q5377468) (← links)
- Recent Results on the Algebraic Approach to the CSP (Q5504700) (← links)
- Unifying the three algebraic approaches to the CSP via minimal Taylor algebras (Q6566475) (← links)
- Constraint satisfaction, graph isomorphism, and the pebbling comonad (Q6612794) (← links)
- Collapsing the bounded width hierarchy for infinite-domain constraint satisfaction problems: when symmetries are enough (Q6654559) (← links)
