Solving promise equations over monoids and groups
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866917941353644032 |
|---|---|
| author | Larrauri, Alberto Živný, Stanislav |
| author_facet | Larrauri, Alberto Živný, Stanislav |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2402_08434 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Solving promise equations over monoids and groups Larrauri, Alberto Živný, Stanislav Computational Complexity Logic in Computer Science 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. |
| title | Solving promise equations over monoids and groups |
| topic | Computational Complexity Logic in Computer Science |
| url | https://arxiv.org/abs/2402.08434 |