The complexity of isomorphism testing

Abstract

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… (More)
DOI: 10.1109/SFCS.1986.53

Topics

  • Presentations referencing similar topics