Reduction of the group isomorphism problem to the group automorphism problem

DOI10.1007/S10469-026-09817-5MaRDI QIDQ7285651zbMATH OpenFDO

Authors Saveliĭ Vyacheslavovich Skresanov

Publication date 22 June 2026

Published in Algebra and Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10469-026-09817-5

Mathematics Subject Classification ID

Computational methods for problems pertaining to group theory (20-08) Automorphisms of abstract finite groups (20D45) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Analysis of algorithms and problem complexity (68Q25)

Cites work

• A note on the graph isomorphism counting problem
• Automorphisms of direct products of finite groups.
• Automorphisms of direct products of finite groups. II.
• Factoring Groups Efficiently
• Graph isomorphism is in the low hierarchy
• GROUP, GRAPHS, ALGORITHMS: THE GRAPH ISOMORPHISM PROBLEM
• scientific article; zbMATH DE number 1849958 (Why is no real title available?)
• Isomorphism of graphs of bounded valence can be tested in polynomial time
• On multidimensional Schur rings of finite groups
• On p-group isomorphism: search-to-decision, counting-to-decision, and nilpotency class reductions via tensors
• On the \(n\log{n}\) isomorphism technique (preliminary report)
• Polynomial-time isomorphism test for groups with abelian Sylow towers.
• Polynomial-Time Isomorphism Test for Groups with No Abelian Normal Subgroups
• Two-closure of rank \(3\) groups in polynomial time

This page was built for publication: Reduction of the group isomorphism problem to the group automorphism problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7285651)