Polynomial-Time Isomorphism Test for Groups with No Abelian Normal Subgroups - (Extended Abstract)

@inproceedings{Babai2012PolynomialTimeIT,
  title={Polynomial-Time Isomorphism Test for Groups with No Abelian Normal Subgroups - (Extended Abstract)},
  author={L{\'a}szl{\'o} Babai and Paolo Codenotti and Youming Qiao},
  booktitle={ICALP},
  year={2012}
}
We consider the problem of testing isomorphism of groups of order n given by Cayley tables. The trivial 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 (SODA… CONTINUE READING

Topics from this paper.