CSP dichotomy for special polyads
From MaRDI portal
Publication:2852579
Recommendations
- CSP dichotomy for special triads
- On the complexity of \(\mathbb{H}\)-coloring for special oriented trees
- The CSP Dichotomy Holds for Digraphs with No Sources and No Sinks (A Positive Answer to a Conjecture of Bang-Jensen and Hell)
- CSP for binary conservative relational structures
- Asking the Metaquestions in Constraint Tractability
Cites work
- Bounded width problems and algebras
- CSP dichotomy for special triads
- Classification of homomorphisms to oriented cycles and of \(k\)-partite satisfiability
- Classifying the Complexity of Constraints Using Finite Algebras
- Closure properties of constraints
- Existence theorems for weakly symmetric operations
- On multiplicative graphs and the product conjecture
- On the complexity of H-coloring
- Polynomial graph-colorings
- The CSP Dichotomy Holds for Digraphs with No Sources and No Sinks (A Positive Answer to a Conjecture of Bang-Jensen and Hell)
- The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
Cited in
(5)
This page was built for publication: CSP dichotomy for special polyads
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2852579)