On the Reduction of the CSP Dichotomy Conjecture to Digraphs

DOI10.1007/978-3-642-40627-0_17zbMath1432.68170arXiv1305.2039OpenAlexW1796497853MaRDI QIDQ5415454

Marcel Jackson, Todd Niven, Jakub Bulín, Dejan Delić

Publication date: 12 May 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1305.2039

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Applications of universal algebra in computer science (08A70) Directed graphs (digraphs), tournaments (05C20) Relational systems, laws of composition (08A02)

Related Items (6)

CSP for binary conservative relational structures ⋮ On the complexity of \(\mathbb{H}\)-coloring for special oriented trees ⋮ On Maltsev digraphs ⋮ Decidability of absorption in relational structures of bounded width. ⋮ Dichotomy for finite tournaments of mixed-type ⋮ Unnamed Item

This page was built for publication: On the Reduction of the CSP Dichotomy Conjecture to Digraphs