Beating the Generator-Enumeration Bound for $p$-Group Isomorphism

  title={Beating the Generator-Enumeration Bound for \$p\$-Group Isomorphism},
  author={David J. Rosenbaum and Fabian Wagner},
  journal={Theor. Comput. Sci.},
We consider the group isomorphism problem: given two finite groups G and H specified by their multiplication tables, decide if G ∼= H . For several decades, the np n+O(1) generatorenumeration bound (where p is the smallest prime dividing the order of the group) has been the best worst-case result for general groups. In this work, we show the first improvement over the generator-enumeration bound for p-groups, which are believed to be the hard case of the group isomorphism problem. We start by… CONTINUE READING
Related Discussions
This paper has been referenced on Twitter 1 time. VIEW TWEETS

From This Paper

Topics from this paper.


Publications citing this paper.
Showing 1-2 of 2 extracted citations


Publications referenced by this paper.
Showing 1-10 of 42 references

Canonical Labeling of Graphs

View 6 Excerpts
Highly Influenced

Computational complexity and the classification of finite simple groups

24th Annual Symposium on Foundations of Computer Science (sfcs 1983) • 1983
View 6 Excerpts
Highly Influenced

Testing Isomorphism of Combinatorial and Algebraic Structures

P. Codenotti
PhD thesis, University of Chicago • 2011
View 5 Excerpts
Highly Influenced

The Complexity of Word and Isomorphism Problems for Finite Groups

R. Lipton, L. Snyder, Y. Zalcstein
Defense Technical Information Center • 1977
View 4 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…