CSP dichotomy for special polyads
From MaRDI portal
Publication:2852579
DOI10.1142/S0218196713500215zbMATH Open1277.68220MaRDI QIDQ2852579FDOQ2852579
Authors: Libor Barto, Jakub Bulín 
Publication date: 9 October 2013
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
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
Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Existence theorems for weakly symmetric operations
- On the complexity of H-coloring
- The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
- Closure properties of constraints
- Classifying the Complexity of Constraints Using Finite Algebras
- On multiplicative graphs and the product conjecture
- The CSP Dichotomy Holds for Digraphs with No Sources and No Sinks (A Positive Answer to a Conjecture of Bang-Jensen and Hell)
- Bounded width problems and algebras
- Polynomial graph-colorings
- Classification of homomorphisms to oriented cycles and of \(k\)-partite satisfiability
- CSP dichotomy for special triads
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)
