Unifying the three algebraic approaches to the CSP via minimal Taylor algebras

DOI10.46298/THEORETICS.24.14MaRDI QIDQ6566475FDOQ6566475

Marcin Kozik, D. N. Zhuk, Andrei A. Bulatov, Libor Barto, Zarathustra Brady

Publication date: 3 July 2024

Published in: TheoretiCS (Search for Journal in Brave)

zbMATH Keywords

polymorphismconstraint satisfaction problemuniversal algebraminimal Taylor algebra

Mathematics Subject Classification ID

Computer science (68-XX)

Cites Work

• Title not available (Why is that?)
• Existence theorems for weakly symmetric operations
• A dichotomy theorem for constraint satisfaction problems on a 3-element set
• Varieties with few subalgebras of powers
• 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
• The complexity of the counting constraint satisfaction problem
• The complexity of satisfiability problems
• Towards a dichotomy theorem for the counting constraint satisfaction problem
• On the algebraic structure of combinatorial problems
• Characterizations of several Maltsev conditions.
• Complexity of conservative constraint satisfaction problems
• Constraint Satisfaction Problems Solvable by Local Consistency Methods
• The structure of finite algebras
• Finitely related clones and algebras with cube terms.
• The shape of congruence lattices
• Monotone monadic SNP and constraint satisfaction
• Tractability and Learnability Arising from Algebras with Few Subpowers
• A Simple Algorithm for Mal'tsev Constraints
• TAYLOR TERMS, CONSTRAINT SATISFACTION AND THE COMPLEXITY OF POLYNOMIAL EQUATIONS OVER FINITE ALGEBRAS
• Dualities for Constraint Satisfaction Problems
• Closed systems of functions and predicates
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The complexity of constraint satisfaction games and QCSP
• Absorbing subalgebras, cyclic terms, and the constraint satisfaction problem
• Existence of cube terms in finite algebras
• Discrete Temporal Constraint Satisfaction Problems
• Mal'tsev conditions, lack of absorption, and solvability.
• Graphs of relational structures
• Complexity of Infinite-Domain Constraint Satisfaction
• Title not available (Why is that?)
• Finitely related algebras in congruence modular varieties have few subpowers
• Title not available (Why is that?)
• Robustly solvable constraint satisfaction problems
• The Complexity of Valued CSPs
• Cube term blockers without finiteness
• The wonderland of reflections
• Title not available (Why is that?)
• A Proof of the CSP Dichotomy Conjecture
• The Complexity of Quantified Constraints: Collapsibility, Switchability, and the Algebraic Formulation
• Algebraic Approach to Promise Constraint Satisfaction
• Promise Constraint Satisfaction: Algebraic Structure and a Symmetric Boolean Dichotomy
• Deciding absorption
• Solving CSPs Using Weak Local Consistency
• On the structure of abstract algebras.
• Title not available (Why is that?)
• QCSP Monsters and the Demise of the Chen Conjecture

Cited In (1)

• Finite algebras with Hom-sets of polynomial size

This page was built for publication: Unifying the three algebraic approaches to the CSP via minimal Taylor algebras

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6566475)