A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf
.
Polynomial-Time Isomorphism Test for Groups with No Abelian Normal Subgroups
[chapter]
2012
Lecture Notes in 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 upon over the past four decades. We demonstrate that the obstacle to efficient algorithms is the presence of abelian normal subgroups; we show this by giving a polynomial-time isomorphism test for groups without nontrivial abelian normal subgroups. This concludes a project started by the authors and J. A. Grochow
doi:10.1007/978-3-642-31594-7_5
fatcat:qkmh5ql4mraoxaaird72svte54