Pages that link to "Item:Q2427535"
From MaRDI portal
The following pages link to Majority constraints have bounded pathwidth duality (Q2427535):
Displaying 14 items.
- List-homomorphism problems on graphs and arc consistency (Q393914) (← links)
- Maltsev digraphs have a majority polymorphism (Q627926) (← links)
- The complexity of the list homomorphism problem for graphs (Q693060) (← 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)
- On Maltsev digraphs (Q2260621) (← links)
- Majority functions on structures with finite duality (Q2427545) (← links)
- On Maltsev Digraphs (Q3007626) (← links)
- (Q3304148) (← links)
- (Q4993594) (← links)
- Solving CSPs Using Weak Local Consistency (Q5009788) (← links)
- Robust Algorithms with Polynomial Loss for Near-Unanimity CSPs (Q5203794) (← links)
- Dualities for Constraint Satisfaction Problems (Q5504701) (← links)
- The smallest hard trees (Q6073305) (← links)
