Dichotomies in the Complexity of Solving Systems of Equations over Finite Semigroups

Authors:
O. Klima;P. Tesson;D. Therien
Affiliations:
Department of Mathematics, Masaryk University, Brno, Czech Republic;Departement d'Informatique et de Genie Logiciel, Universite Laval, Quebec, Quebec, Canada;School of Computer Science, McGill University, Montreal, Quebec, Canada
Venue:
Theory of Computing Systems
Year:
2007

Citing 0
Cited 4

Constraint Satisfaction Problems with Infinite Templates

Complexity of Constraints
Systems of equations satisfied in all commutative finite semigroups

FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Systems of equations over finite semigroups and the #CSP dichotomy conjecture

MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Identity problems, solvability of equations and unification in varieties of semigroups related to varieties of groups

Algebraic Foundations in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of testing whether a given system of equations over a fixed finite semigroup S has a solution. For the case where S is a monoid, we prove that the problem is computable in polynomial time when S is commutative and is the union of its subgroups but is NP-complete otherwise. When S is a monoid or a regular semigroup, we obtain similar dichotomies for the restricted version of the problem where no variable occurs on the right-hand side of each equation. We stress connections between these problems and constraint satisfaction problems. In particular, for any finite domain D and any finite set of relations Γ over D, we construct a finite semigroup SΓ such that CSP(Γ) is polynomial-time equivalent to the satifiability problem for systems of equations over SΓ.