# Beating the generator-enumeration bound for p-group isomorphism

@article{Rosenbaum2015BeatingTG, title={Beating the generator-enumeration bound for p-group isomorphism}, author={David J. Rosenbaum and F. Wagner}, journal={Theor. Comput. Sci.}, year={2015}, volume={593}, pages={16-25} }

We consider the group isomorphism problem: given two finite groups G and H specified by their multiplication tables, decide if G cong H. For several decades, the n^(log_p n + O(1)) generator-enumeration 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… CONTINUE READING

#### Topics from this paper.

9 Citations

Beating the Generator-Enumeration Bound for Solvable-Group Isomorphism

- Computer Science, Mathematics
- 2020

1

Incorporating Weisfeiler-Leman into algorithms for group isomorphism

- Mathematics, Computer Science
- 2019

5

A unifying method for the design of algorithms canonizing combinatorial objects

- Computer Science, Mathematics
- 2019

7

Normalizers and permutational isomorphisms in simply-exponential time

- Mathematics, Computer Science
- 2020

5

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 53 REFERENCES

Linear time algorithms for Abelian group isomorphism and related problems

- Computer Science, Mathematics
- 2007

32

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

- Mathematics, Computer Science
- 2012

24

Isomorphism of Graphs of Bounded Valence Can Be Tested in Polynomial Time

- Mathematics, Computer Science
- 1980

234

Polynomial-time Isomorphism Test for Groups with Abelian Sylow Towers

- Computer Science, Mathematics
- 2012

21