A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Polynomial-time Isomorphism Test for Groups with Abelian Sylow Towers

2012
*
Symposium on Theoretical Aspects of Computer Science
*

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 et al. in SODA 2011) presented a polynomial-time algorithm for groups without abelian normal subgroups, which suggests solvable groups as the hard case for group isomorphism problem. Extending recent work by Le Gall (STACS 2009) and Qiao et al.

doi:10.4230/lipics.stacs.2012.453
dblp:conf/stacs/BabaiQ12
fatcat:exp2sdlwpfc4naj33wxh2dljqa