Solving Promise Equations over Monoids and Groups

Alberto Larrauri, Stanislav Zivný

Abstract: We give a complete complexity classification for the problem of finding a solution to a given system of equations over a fixed finite monoid, given that a solution over a more restricted monoid exists. As a corollary, we obtain a complexity classification for the same problem over groups.