Reduction of the Group Isomorphism Problem to the Group Automorphism Problem | Sciact - Система учета научной деятельности ИМ СО РАН

Reduction of the Group Isomorphism Problem to the Group Automorphism Problem Научная публикация

Журнал

Algebra and Logic
ISSN: 0002-5232 , E-ISSN: 1573-8302

Вых. Данные

Год: 2026, Том: 64, Номер: 2, Страницы: 105-112 Страниц : 8 DOI: 10.1007/s10469-026-09817-5

Ключевые слова

group isomorphism problem, automorphism group, polynomial time.

Авторы

Skresanov S.V. ^1,2

Организации

1	Sobolev Institute of Mathematics of the Siberian Branch of the Russian Academy of Sciences, Novosibirsk, Russia
2	Novosibirsk State University

Информация о финансировании (1)

Российский научный фонд

24-11-00127

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.

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

Поступила в редакцию:	30 сент. 2025 г.
Принята к публикации:	11 нояб. 2025 г.
Опубликована в печати:	11 февр. 2026 г.
Опубликована online:	11 февр. 2026 г.

Web of science:	WOS:001686850100001
Scopus:	2-s2.0-105030089274
OpenAlex:	W7128489791

Пока нет цитирований