11 citations · 31 across the 6 of their papers we have counts for
4 papers · 1 filter
Beating the Generator-Enumeration Bound for Solvable-Group Isomorphism
David J. Rosenbaum
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 n^(log_p n…
Beating the Generator-Enumeration Bound for -Group Isomorphism
David J. Rosenbaum, Fabian Wagner
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))…
Bidirectional Collision Detection and Faster Deterministic Isomorphism Testing
David J. Rosenbaum
In this work, we introduce bidirectional collision detection --- a new algorithmic tool that applies to the collision problems that arise in many isomorphism problems. For the grou…
Breaking the n^(log n) Barrier for Solvable-Group Isomorphism
David Rosenbaum
We consider the group isomorphism problem: given two finite groups G and H specified by their multiplication tables, decide if G and H are isomorphic. The n^(log n) barrier for gro…