We investigate the power of counting in \textsc{Group Isomorphism}. We first leverage the count-free variant of the Weisfeiler--Leman Version I algorithm for groups (Brachter & Schweitzer, LICS 2020) in tandem with limited non-determinism and limited counting to improve the parallel complexity of isomorphism testing for several families of groups. In particular, we show the following

我们研究了群同构的计数能力。我们首先 利用Weisfeler-Leman版本I算法的免计数变体 针对集团(Brachter&Schweitzer，LICS 2020)与LIMITED 非决定论和有限计数来提高并行计算的复杂性 几个群族的同构检验。特别是，我们向您展示了 以下是