A CFSG-free analysis of Babai's quasipolynomial GI-algorithm

Abstract

We obtain a weaker but still quasipolynomial version of Babai's famous GI-algorithm.

We obtain a quasipolynomial version of Babai's famous Graph Isomorphism algorithm which does not rely on the Classification theorem of Finite Simple Groups

References in corpus (1)

• Isomorphismes de graphes en temps quasi-polynomial (d'après Babai et Luks, Weisfeiler-Leman...)

Cited by in corpus (3)

• On short expressions for cosets of permutation subgroups
• The Graph Isomorphism Problem: Local Certificates for Giant Action
• Towards a CFSG-free diameter bound for $\mathrm{Alt}(n)$