We investigate the constant-depth circuit complexity of the Isomorphism Problem, Minimum Generating Set Problem (MGS), and Sub(quasi)group Membership Problem (Membership) for groups and quasigroups (=Latin squares), given as input in terms of their multiplication (Cayley) tables. Despite decades of research on these problems, lower bounds for these problems even against depth-$2$ AC circuits remain unknown. Perhaps surprisingly, Chattopadhyay, Tor\'an, and Wagner (FSTTCS 2010; ACM Trans. Comput. Theory, 2013) showed that Quasigroup Isomorphism could be solved by AC circuits of depth $O(\log \log n)$ using $O(\log^2 n)$ nondeterministic bits, a class we denote $\exists^{\log^2(n)}FOLL$. We narrow this gap by improving the upper bound for many of these problems to $quasiAC^0$, thus decreasing the depth to constant. In particular, we show: - MGS for quasigroups is in $\exists^{\log^2(n)}\forall^{\log n}NTIME(\mathrm{polylog}(n))\subseteq quasiAC^0$. Papadimitriou and Yannakakis (J. Comput. Syst. Sci., 1996) conjectured that this problem was $\exists^{\log^2(n)}P$-complete; our results refute a version of that conjecture for completeness under $quasiAC^0$ reductions unconditionally, and under polylog-space reductions assuming EXP $\neq$ PSPACE. - MGS for groups is in $AC^{1}(L)$, improving on the previous upper bound of $P$ (Lucchini & Thakkar, J. Algebra, 2024). - Quasigroup Isomorphism belongs to $\exists^{\log^2(n)}AC^0(DTISP(\mathrm{polylog},\log)\subseteq quasiAC^0$, improving on the previous bound of $\exists^{\log^2(n)}L\cap\exists^{\log^2(n)}FOLL\subseteq quasiFOLL$ (Chattopadhyay, Tor\'an, & Wagner, ibid.; Levet, Australas. J. Combin., 2023). Our results suggest that understanding the constant-depth circuit complexity may be key to resolving the complexity of problems concerning (quasi)groups in the multiplication table model.

翻译：本研究探讨了群与拟群（即拉丁方）在同构问题、最小生成集问题（MGS）以及子（拟）群成员问题（Membership）上的常数深度电路复杂性，其中输入以乘法（凯莱）表形式给出。尽管这些问题已被研究数十年，但即使针对深度为$2$的AC电路，其下界仍未可知。令人意外的是，Chattopadhyay、Torán与Wagner（FSTTCS 2010; ACM Trans. Comput. Theory, 2013）证明了拟群同构问题可由深度$O(\log \log n)$且使用$O(\log^2 n)$非确定比特的AC电路求解，此类电路我们记为$\exists^{\log^2(n)}FOLL$。我们通过将其中多数问题的上界改进至$quasiAC^0$来缩小这一差距，从而将深度降至常数。具体而言，我们证明：- 拟群的MGS属于$\exists^{\log^2(n)}\forall^{\log n}NTIME(\mathrm{polylog}(n))\subseteq quasiAC^0$。Papadimitriou与Yannakakis（J. Comput. Syst. Sci., 1996）曾猜想该问题是$\exists^{\log^2(n)}P$完全的；我们的结果无条件地否定了该猜想在$quasiAC^0$归约下的完全性版本，并在假设EXP $\neq$ PSPACE的条件下否定了其在多对数空间归约下的完全性。- 群的MGS属于$AC^{1}(L)$，改进了先前$P$的上界（Lucchini & Thakkar, J. Algebra, 2024）。- 拟群同构问题属于$\exists^{\log^2(n)}AC^0(DTISP(\mathrm{polylog},\log)\subseteq quasiAC^0$，优于先前$\exists^{\log^2(n)}L\cap\exists^{\log^2(n)}FOLL\subseteq quasiFOLL$的界（Chattopadhyay, Torán, & Wagner, 同上；Levet, Australas. J. Combin., 2023）。我们的结果表明，理解常数深度电路复杂性可能是解决乘法表模型中（拟）群相关问题复杂性的关键。