Graph Isomorphism is Not AC0-Reducible to Group Isomorphism

Author:

Chattopadhyay Arkadev1,Torán Jacobo2,Wagner Fabian2

Affiliation:

1. University of Toronto

2. University of Ulm

Abstract

We give a new upper bound for the Group and Quasigroup Isomorphism problems when the input structures are given explicitly by multiplication tables. We show that these problems can be computed by polynomial size nondeterministic circuits of unbounded fan-in with O (log log n ) depth and O (log 2 n ) nondeterministic bits, where n is the number of group elements. This improves the existing upper bound for the problems. In the previous bound the circuits have bounded fan-in but depth O (log 2 n ) and also O (log 2 n ) nondeterministic bits. We then prove that the kind of circuits from our upper bound cannot compute the Parity function. Since Parity is AC 0 -reducible to Graph Isomorphism, this implies that Graph Isomorphism is strictly harder than Group or Quasigroup Isomorphism under the ordering defined by AC 0 reductions. We extend this result to the stronger ACC 0 [ p ] reduction and its randomized version.

Publisher

Association for Computing Machinery (ACM)

Subject

Computational Theory and Mathematics,Theoretical Computer Science

Cited by 6 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Constant Depth Circuit Complexity for Generating Quasigroups;Proceedings of the 2024 International Symposium on Symbolic and Algebraic Computation;2024-07-16

2. Count-free Weisfeiler–Leman and group isomorphism;International Journal of Algebra and Computation;2024-04-03

3. On the Descriptive Complexity of Groups without Abelian Normal Subgroups (Extended Abstract);Electronic Proceedings in Theoretical Computer Science;2023-09-30

4. On the Parallel Complexity of Group Isomorphism via Weisfeiler–Leman;Fundamentals of Computation Theory;2023

5. Epidermal Growth Factor Receptor Inhibition Reverses Cellular and Transcriptomic Alterations Induced by Hypoxia in the Neonatal Piglet Brain;iScience;2020-12

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3