The complexity of isomorphism testing
Max Garzón, Yechezkel Zalcstein · 1986
A polynomial time isomorphism test for a class of groups, properly containing the class of abelian groups, is presented. Isomorphism testing of group presentations for (a subclass of) the same class of groups is shown to be (graph) isomorphism complete. These seem to be the first known isomorphism complete problems in group theory. Subexponential tests are presented as well for rings and algebras.