Reduction of the Group Isomorphism Problem to the Group Automorphism Problem Full article
| Journal |
Algebra and Logic
ISSN: 0002-5232 , E-ISSN: 1573-8302 |
||||
|---|---|---|---|---|---|
| Output data | Year: 2026, Volume: 64, Number: 2, Pages: 105-112 Pages count : 8 DOI: 10.1007/s10469-026-09817-5 | ||||
| Tags | group isomorphism problem, automorphism group, polynomial time. | ||||
| Authors |
|
||||
| Affiliations |
|
Funding (1)
| 1 | Russian Science Foundation | 24-11-00127 |
Abstract:
It is well known that the graph isomorphism problem is polynomial-time reducible to the graph automorphism problem (in fact, these two problems are polynomial-time equivalent). We show that the group isomorphism problem is polynomial-time reducible to the group
automorphism problem. Reductions to other relevant problems like automorphism counting are also given.
Cite:
Skresanov S.V.
Reduction of the Group Isomorphism Problem to the Group Automorphism Problem
Algebra and Logic. 2026. V.64. N2. P.105-112. DOI: 10.1007/s10469-026-09817-5 WOS Scopus OpenAlex
Reduction of the Group Isomorphism Problem to the Group Automorphism Problem
Algebra and Logic. 2026. V.64. N2. P.105-112. DOI: 10.1007/s10469-026-09817-5 WOS Scopus OpenAlex
Dates:
| Submitted: | Sep 30, 2025 |
| Accepted: | Nov 11, 2025 |
| Published print: | Feb 11, 2026 |
| Published online: | Feb 11, 2026 |
Identifiers:
| Web of science: | WOS:001686850100001 |
| Scopus: | 2-s2.0-105030089274 |
| OpenAlex: | W7128489791 |
Citing:
Пока нет цитирований