# Absorbing Subalgebras, Cyclic Terms, and the Constraint Satisfaction Problem

@article{Barto2012AbsorbingSC,
title={Absorbing Subalgebras, Cyclic Terms, and the Constraint Satisfaction Problem},
author={L. Barto and M. Kozik},
journal={Log. Methods Comput. Sci.},
year={2012},
volume={8}
}
• Published 2012
• Mathematics, Computer Science
• Log. Methods Comput. Sci.
The Algebraic Dichotomy Conjecture states that the Constraint Satisfaction Problem over a fixed template is solvable in polynomial time if the algebra of polymor- phisms associated to the template lies in a Taylor variety, and is NP-complete otherwise. This paper provides two new characterizations of finitely generated Taylor varieties. The first characterization is using absorbing subalgebras and the second one cyclic terms. These new conditions allow us to reprove the conjecture of Bang… Expand
125 Citations

#### Topics from this paper

Canonical Polymorphisms of Ramsey Structures and the Unique Interpolation Property
• Computer Science, Mathematics
• 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
• 2021
This work gives sufficient conditions when this method can be applied and illustrates how to use the general results to prove a new complexity dichotomy for first-order expansions of the basic relations of the spatial reasoning formalism RCC5. Expand
Finitely related algebras in congruence modular varieties have few subpowers
We show that every finite algebra, which is finitely related and lies in a congruence modular variety, has few subpowers. This result, combined with other theorems, has interesting consequences forExpand
Universal Algebraic Methods for Constraint Satisfaction Problems
• Computer Science, Mathematics
• ArXiv
• 2016
The utility of new techniques that help attack the class of finite algebras known as "commutative idempotent binars" (CIBs) are demonstrated by using them to prove that every CIB of cardinality at most 4 yields a tractable CSP. Expand
Strong subalgebras and the Constraint Satisfaction Problem
• Dmitriy Zhuk
• Computer Science, Mathematics
• J. Multiple Valued Log. Soft Comput.
• 2021
It is proved that if a constraint language is not preserved by a WNU operation then the corresponding CSP is NP-hard, and strong subalgebras that allow us to reduce domains of the variables iteratively are considered. Expand
Universal Algebraic Methods for Constraint Satisfaction Problems Part I. Preliminaries
After substantial progress over the last 15 years, the " algebraic CSP-dichotomy conjecture " reduces to the following: every local constraint satisfaction problem (CSP) associated with a finiteExpand
Algebras and Algorithms
• M. Valeriote
• Computer Science, Mathematics
• 2015 IEEE International Symposium on Multiple-Valued Logic
• 2015
The necessary background from universal algebra is presented to describe the connection between algebra and the constraint satisfaction problems (CSP) and the progress that has been made towards settling the Dichotomy Conjecture of Feder and Vardi. Expand
A Proof of CSP Dichotomy Conjecture
• Dmitriy Zhuk
• Computer Science, Mathematics
• 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)
• 2017
An algorithm is presented that solves Constraint Satisfaction Problem in polynomial time for constraint languages having a weak near unanimity polymorphism, which proves the remaining part of the conjecture. Expand
Digraph related constructions and the complexity of digraph homomorphism problems
• Computer Science, Mathematics
• ArXiv
• 2013
The property of "strict width" and solvability by few subpowers are unstable under first order reductions and the algebraic CSP dichotomy conjecture holds for digraphs whose symmetric closure is a complete graph. Expand
A Proof of the CSP Dichotomy Conjecture
This article presents an algorithm that solves Constraint Satisfaction Problem in polynomial time for constraint languages having a weak near unanimity polymorphism, which proves the remaining part of the conjecture. Expand
An Algebraic Approach to Valued Constraint Satisfaction
• Mathematics, Computer Science
• CSL
• 2017
A notion of polymorphism is introduced that captures the pp-definability in the style of Geiger’s result, and sufficient conditions for tractability of the classical CSP, related to the existence of certain polymorphisms, are shown to serve also for the valued case. Expand

#### References

SHOWING 1-10 OF 44 REFERENCES
Constraint Satisfaction Problems and Finite Algebras
• Mathematics, Computer Science
• ICALP
• 2000
It is shown that any restricted set of constraint types can be associated with a finite universal algebra and the result is a dichotomy theorem which significantly generalises Schaefer's dichotomy for the Generalised Satisfiability problem. Expand
A strong Mal’cev condition for locally finite varieties omitting the unary type
We show that a finite algebra has a Taylor operation if and only if it has an operation satisfying a particular set of 6-ary Taylor identities. As a consequence we get the first strong Mal’cevExpand
Graphs, polymorphisms and the complexity of homomorphism problems
• Computer Science, Mathematics
• STOC
• 2008
We use a connection between polymorphisms and the structure of smooth digraphs to prove the conjecture of Bang-Jensen and Hell from 1990 and, as a consequence, a conjecture of Bang-Jensen, Hell andExpand
Classifying the Complexity of Constraints Using Finite Algebras
• Mathematics, Computer Science
• SIAM J. Comput.
• 2005
It is shown that any set of relations used to specify the allowed forms of constraints can be associated with a finite universal algebra and how the computational complexity of the corresponding constraint satisfaction problem is connected to the properties of this algebra is explored. Expand
A new line of attack on the dichotomy conjecture
• Computer Science, Mathematics
• STOC '09
• 2009
This work gives an entirely new and transparent proof to the Hell-Nesetril theorem, which states that for a simple, connected and undirected graph H, the problem CSP(H) is NP-hard if and only if H is non-bipartite. Expand
The Dichotomy for Conservative Constraint Satisfaction Problems Revisited
• L. Barto
• Mathematics, Computer Science
• 2011 IEEE 26th Annual Symposium on Logic in Computer Science
• 2011
This paper provides a short and transparent proof of the dichotomy conjecture of Feder and Vardi stating that the CSP over a fixed constraint language is either NP-complete, or tractable. Expand
The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
• Mathematics, Computer Science
• SIAM J. Comput.
• 1998
This paper isolates a class (of problems specified by) "monotone monadic SNP without inequality" which may exhibit a dichotomy, and explains the placing of all these restrictions by showing, essentially using Ladner's theorem, that classes obtained by using only two of the above three restrictions do not show this dichotomy. Expand
The CSP Dichotomy Holds for Digraphs with No Sources and No Sinks (A Positive Answer to a Conjecture of Bang-Jensen and Hell)
• Mathematics, Computer Science
• SIAM J. Comput.
• 2009
It is shown that the CSP dichotomy for digraphs with no sources or sinks agrees with the algebraic characterization conjectured by Bulatov, Jeavons, and Krokhin in 2005. Expand
Closure properties of constraints
• Mathematics, Computer Science
• JACM
• 1997
This paper investigates the subclasses that arise from restricting the possible constraint types, and shows that any set of constraints that does not give rise to an NP-complete class of problems must satisfy a certain type of algebraic closure condition. Expand
Congruence modularity implies cyclic terms for finite algebras
• Mathematics
• 2009
An n-ary operation f : An → A is called cyclic if it is idempotent and $${f(a_1, a_2, a_3, \ldots , a_n) = f(a_2, a_3, \ldots , a_n, a_1)}$$ for every $${a_1, \ldots, a_n \in A}$$. We prove thatExpand