Solving promise equations over monoids and groups
Computational Complexity
2025-03-04 v4 Logic in Computer Science
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.
Cite
@article{arxiv.2402.08434,
title = {Solving promise equations over monoids and groups},
author = {Alberto Larrauri and Stanislav Živný},
journal= {arXiv preprint arXiv:2402.08434},
year = {2025}
}
Comments
Full version of an ICALP 2024 paper