paper

Solving promise equations over monoids and groups

arXiv:2402.08434 · doi:10.1145/3698106

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.

arXiv commentFull version of an ICALP 2024 paper

References in corpus (7)