Standard

Reduction of the Group Isomorphism Problem to the Group Automorphism Problem. / Skresanov, S. V.

In: Algebra and Logic, Vol. 64, No. 2, 05.2025, p. 105-112.

Research output: Contribution to journalArticlepeer-review

Harvard

APA

Vancouver

Skresanov SV. Reduction of the Group Isomorphism Problem to the Group Automorphism Problem. Algebra and Logic. 2025 May;64(2):105-112. doi: 10.1007/s10469-026-09817-5

Author

Skresanov, S. V. / Reduction of the Group Isomorphism Problem to the Group Automorphism Problem. In: Algebra and Logic. 2025 ; Vol. 64, No. 2. pp. 105-112.

BibTeX

@article{95b5dfaa9f50428b82df812c1bb5ac61,
title = "Reduction of the Group Isomorphism Problem to the Group Automorphism Problem",
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.",
keywords = "automorphism group, group isomorphism problem, polynomial time",
author = "Skresanov, {S. V.}",
note = "Skresanov, S.V. Reduction of the Group Isomorphism Problem to the Group Automorphism Problem. Algebra Logic 64, 105–112 (2025). https://doi.org/10.1007/s10469-026-09817-5 The work is supported by the Russian Science Foundation (project No. 24-11-00127, https://rscf.ru/en/project/24-11-00127/).",
year = "2025",
month = may,
doi = "10.1007/s10469-026-09817-5",
language = "English",
volume = "64",
pages = "105--112",
journal = "Algebra and Logic",
issn = "0002-5232",
publisher = "Springer US",
number = "2",

}

RIS

TY - JOUR

T1 - Reduction of the Group Isomorphism Problem to the Group Automorphism Problem

AU - Skresanov, S. V.

N1 - Skresanov, S.V. Reduction of the Group Isomorphism Problem to the Group Automorphism Problem. Algebra Logic 64, 105–112 (2025). https://doi.org/10.1007/s10469-026-09817-5 The work is supported by the Russian Science Foundation (project No. 24-11-00127, https://rscf.ru/en/project/24-11-00127/).

PY - 2025/5

Y1 - 2025/5

N2 - 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.

AB - 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.

KW - automorphism group

KW - group isomorphism problem

KW - polynomial time

UR - https://www.scopus.com/pages/publications/105030089274

UR - https://www.mendeley.com/catalogue/2673e524-a09d-3281-bec1-684dc55d71f0/

U2 - 10.1007/s10469-026-09817-5

DO - 10.1007/s10469-026-09817-5

M3 - Article

VL - 64

SP - 105

EP - 112

JO - Algebra and Logic

JF - Algebra and Logic

SN - 0002-5232

IS - 2

ER -

ID: 75491295