Solving Promise Equations over Monoids and Groups
ACM Transactions on Computational Logic · 31.01.2025 · 26 (1) · 1-24
DOI: 10.1145/3698106 ↗Kurz gefasst
Fachartikel in der Zeitschrift ACM Transactions on Computational Logic, online erschienen am 06.12.2024. Verfasst von Alberto Larrauri und 1 weiteren Autor:innen. Die Arbeit wurde bisher 2-mal zitiert (Crossref) und nennt 47 Literaturangaben. Gefördert von: UKRI.
Abstract (Originalsprache)
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.
Förderung
- UKRI
Zitieren
APA
Larrauri, A., & Živný, S. (2025). Solving Promise Equations over Monoids and Groups. ACM Transactions on Computational Logic, 26(1), 1-24. https://doi.org/10.1145/3698106
Vancouver
Larrauri A, Živný S. Solving Promise Equations over Monoids and Groups. ACM Transactions on Computational Logic. 2025;26(1):1-24. doi:10.1145/3698106
BibTeX
@article{Larrauri2025,
author = {Larrauri, Alberto and Živný, Stanislav},
title = {Solving Promise Equations over Monoids and Groups},
journal = {ACM Transactions on Computational Logic},
year = {2025},
volume = {26},
number = {1},
pages = {1--24},
doi = {10.1145/3698106}
}
EUVIMED