Scholarlink

<p>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.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Reduction of the Group Isomorphism Problem to the Group Automorphism Problem

  • 期刊论文

  • 发表日期：

    2025年5月1日

查看全文
  • S. V. Skresanov

摘要

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.