Pages that link to "Item:Q5504700"
From MaRDI portal
The following pages link to Recent Results on the Algebraic Approach to the CSP (Q5504700):
Displaying 24 items.
- Distance constraint satisfaction problems (Q259047) (← links)
- Tractability in constraint satisfaction problems: a survey (Q271997) (← links)
- Testing list \(H\)-homomorphisms (Q347111) (← links)
- List-homomorphism problems on graphs and arc consistency (Q393914) (← links)
- Key (critical) relations preserved by a weak near-unanimity function (Q522228) (← 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)
- On the complexity of \(\mathbb{H}\)-coloring for special oriented trees (Q1686250) (← links)
- Generic expression hardness results for primitive positive formula comparison (Q1951576) (← links)
- Constraint satisfaction problems over semilattice block Mal'tsev algebras (Q2272992) (← links)
- The number of clones determined by disjunctions of unary relations (Q2322711) (← links)
- Characterizations of several Maltsev conditions. (Q2351504) (← links)
- Commutative idempotent groupoids and the constraint satisfaction problem. (Q2351518) (← links)
- On algebras with many symmetric operations (Q2821826) (← links)
- On the CSP Dichotomy Conjecture (Q3007637) (← links)
- Nonnegative Weighted #CSP: An Effective Complexity Dichotomy (Q3179267) (← links)
- Constraint Satisfaction Problems Solvable by Local Consistency Methods (Q3189638) (← links)
- OMITTING TYPES, BOUNDED WIDTH AND THE ABILITY TO COUNT (Q3398315) (← links)
- Algebra and the Complexity of Digraph CSPs: a Survey (Q4993603) (← links)
- Aggregation of Votes with Multiple Positions on Each Issue (Q5283212) (← links)
- Dualities for Constraint Satisfaction Problems (Q5504701) (← links)
- (Q5863609) (← links)
- Not all nilpotent monoids are finitely related (Q6118311) (← links)
