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

Cites work

scientific article; zbMATH DE number 3853164 (Why is no real title available?)
scientific article; zbMATH DE number 4029649 (Why is no real title available?)
scientific article; zbMATH DE number 4035895 (Why is no real title available?)
scientific article; zbMATH DE number 2117181 (Why is no real title available?)
scientific article; zbMATH DE number 7359806 (Why is no real title available?)
scientific article; zbMATH DE number 3336786 (Why is no real title available?)
scientific article; zbMATH DE number 7536113 (Why is no real title available?)
A Simple Algorithm for Mal'tsev Constraints
A dichotomy theorem for constraint satisfaction problems on a 3-element set
A proof of the CSP dichotomy conjecture
Absorbing subalgebras, cyclic terms, and the constraint satisfaction problem
Absorption in universal algebra and CSP
Algebraic Approach to Promise Constraint Satisfaction
Characterizations of several Maltsev conditions.
Classifying the Complexity of Constraints Using Finite Algebras
Closed systems of functions and predicates
Closure properties of constraints
Complexity of conservative constraint satisfaction problems
Complexity of infinite-domain constraint satisfaction
Constraint Satisfaction Problems Solvable by Local Consistency Methods
Cube term blockers without finiteness
Deciding absorption
Discrete temporal constraint satisfaction problems
Dualities for Constraint Satisfaction Problems
Existence of cube terms in finite algebras
Existence theorems for weakly symmetric operations
Finitely related algebras in congruence modular varieties have few subpowers
Finitely related clones and algebras with cube terms.
Graphs of relational structures: restricted types
Mal'tsev conditions, lack of absorption, and solvability.
Monotone monadic SNP and constraint satisfaction
On the algebraic structure of combinatorial problems
On the structure of abstract algebras.
Promise constraint satisfaction: algebraic structure and a symmetric Boolean dichotomy
QCSP Monsters and the Demise of the Chen Conjecture
Robustly solvable constraint satisfaction problems
Solving CSPs using weak local consistency
TAYLOR TERMS, CONSTRAINT SATISFACTION AND THE COMPLEXITY OF POLYNOMIAL EQUATIONS OVER FINITE ALGEBRAS
The Complexity of Quantified Constraints: Collapsibility, Switchability, and the Algebraic Formulation
The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)
The complexity of constraint satisfaction games and QCSP
The complexity of satisfiability problems
The complexity of the counting constraint satisfaction problem
The complexity of valued CSPs
The shape of congruence lattices
The structure of finite algebras
The wonderland of reflections
Towards a dichotomy theorem for the counting constraint satisfaction problem
Tractability and learnability arising from algebras with few subpowers
Universal algebra. Fundamentals and selected topics
Varieties with few subalgebras of powers

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)