Beating the Generator-Enumeration Bound for Solvable-Group Isomorphism

  title={Beating the Generator-Enumeration Bound for Solvable-Group Isomorphism},
  author={David J. Rosenbaum},
  journal={ACM Transactions on Computation Theory (TOCT)},
  pages={1 - 18}
  • David J. Rosenbaum
  • Published 2020
  • Mathematics, Computer Science
  • ACM Transactions on Computation Theory (TOCT)
We consider the isomorphism problem for groups specified by their multiplication tables. Until recently, the best published bound for the worst-case was achieved by the nlogp n + O(1) generator-enumeration algorithm where n is the order of the group and p is the smallest prime divisor of n. In previous work with Fabian Wagner, we showed an n(1 / 2) logp n + O(log n / log log n) -time algorithm for testing isomorphism of p-groups by building graphs with degree bounded by p + O(1) that represent… Expand
1 Citations
Technical Report Column


On the Complexity of Group Isomorphism
  • Fabian Wagner
  • Mathematics, Computer Science
  • Electron. Colloquium Comput. Complex.
  • 2011
  • 7
  • Highly Influential
  • PDF
Canonical labeling of graphs
  • 395
  • Highly Influential
  • PDF
Isomorphism Testing for p-Groups
  • E. O'Brien
  • Computer Science, Mathematics
  • J. Symb. Comput.
  • 1994
  • 39
  • Highly Influential
A Course in the Theory of Groups
  • 3,020
  • Highly Influential
On the Sylow Systems of a Soluble Group
  • 58
  • Highly Influential