Reduction of the group isomorphism problem to the group automorphism problem
Computational Complexity
2025-03-04 v1 Group Theory
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, analogously, the group isomorphism problem is polynomial-time reducible to the group automorphism problem. Reductions to other relevant problems like automorphism counting are also given.
Keywords
Cite
@article{arxiv.2503.01180,
title = {Reduction of the group isomorphism problem to the group automorphism problem},
author = {Saveliy V. Skresanov},
journal= {arXiv preprint arXiv:2503.01180},
year = {2025}
}
Comments
7 pages