Polynomial-time Isomorphism Test for Groups with Abelian Sylow Towers

摘要

We consider the problem of testing isomorphism of groups of order n given by Cayley tables. The trivial n^{log n} bound on the time complexity for the general case has not been improved over the past four decades. Recently, Babai et al. (following Babai e