Work

Solving Promise Equations over Monoids and Groups

Year: 2024

Type: article

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.

Source: ACM Transactions on Computational Logic

DOI: 10.1145/3698106

Authors: Alberto Larrauri, Stanislav Živný

Institution: University of Oxford

Language: English

Topic: semigroups and automata theory

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: hybrid

Funder: UK Research and Innovation

Award: G8702647912