Pages that link to "Item:Q3460423"
From MaRDI portal
The following pages link to A finer reduction of constraint problems to digraphs (Q3460423):
Displayed 11 items.
- Reflexive digraphs with near unanimity polymorphisms (Q442320) (← links)
- On the complexity of \(\mathbb{H}\)-coloring for special oriented trees (Q1686250) (← links)
- Algebraic foundations for qualitative calculi and networks (Q1733063) (← links)
- Galois connections for patterns: an algebra of labelled graphs (Q2044173) (← links)
- The number of clones determined by disjunctions of unary relations (Q2322711) (← links)
- (Q4993594) (← links)
- The Complexity of Valued CSPs (Q4993602) (← links)
- Algebra and the Complexity of Digraph CSPs: a Survey (Q4993603) (← links)
- Promise Constraint Satisfaction: Algebraic Structure and a Symmetric Boolean Dichotomy (Q5096441) (← links)
- Binarisation for Valued Constraint Satisfaction Problems (Q5371026) (← links)
- The smallest hard trees (Q6073305) (← links)