Projects
Reading
People
Chat
SU\G
(đ¸)
/K¡U
Projects
Reading
People
Chat
Sign Up
Light
Dark
System
Breaking the n^(log n) Barrier for Solvable-Group Isomorphism
David J. Rosenbaum
Type:
Preprint
Publication Date:
2012-05-03
Citations:
7
View Publication
Share
Locations
arXiv (Cornell University) -
View
Similar Works
Action
Title
Year
Authors
+
Breaking the n^(log n) Barrier for Solvable-Group Isomorphism
2012
David Rosenbaum
+
Breaking the nlog n barrier for solvable-group isomorphism
2013
David J. Rosenbaum
+
Beating the Generator-Enumeration Bound for $p$-Group Isomorphism
2013
David J. Rosenbaum
Fabian Wagner
+
Beating the Generator-Enumeration Bound for $p$-Group Isomorphism
2013
David J. Rosenbaum
Fabian Wagner
+
PDF
Chat
Beating the Generator-Enumeration Bound for Solvable-Group Isomorphism
2020
David J. Rosenbaum
+
Beating the Generator-Enumeration Bound for Solvable-Group Isomorphism
2014
David J. Rosenbaum
+
Beating the Generator-Enumeration Bound for Solvable-Group Isomorphism
2014
David J. Rosenbaum
+
PDF
Chat
Beating the generator-enumeration bound for p-group isomorphism
2015
David J. Rosenbaum
Fabian Wagner
+
PDF
Chat
Enhanced Algorithm for Modular Isomorphism Problem Resolution in Small Group Orders
2024
I. U. Udoakpan
Michael N. John
+
PDF
Chat
Structure computation and discrete logarithms in finite abelian $p$-groups
2010
Andrew V. Sutherland
+
Group isomorphism is nearly-linear time for most orders.
2020
Heiko Dietrich
James B. Wilson
+
Group isomorphism is nearly-linear time for most orders
2020
Heiko Dietrich
James B. Wilson
+
Count-Free Weisfeiler--Leman and Group Isomorphism
2022
Nathaniel A. Collins
Michael Levet
+
Solvable Group Isomorphism Is (Almost) in NP ⊠coNP
2011
V. Arvind
Jacobo TorĂĄn
+
PDF
Chat
Isomorphism in expanding families of indistinguishable groups
2012
Mark L. Lewis
James B. Wilson
+
Bidirectional Collision Detection and Faster Deterministic Isomorphism Testing
2013
David J. Rosenbaum
+
Bidirectional Collision Detection and Faster Deterministic Isomorphism Testing
2013
David J. Rosenbaum
+
Baby-Step Giant-Step Algorithms for the Symmetric Group
2016
Eric Bach
Bryce Sandlund
+
Baby-Step Giant-Step Algorithms for the Symmetric Group
2016
Eric Bach
Bryce Sandlund
+
PDF
Chat
A cryptographic primitive based on hidden-order groups
2009
Saxena Amitabh
Soh Ben
Works That Cite This (6)
Action
Title
Year
Authors
+
Isomorphism problems for tensors, groups, and cubic forms: completeness and reductions
2019
Joshua A. Grochow
Youming Qiao
+
Breaking the nlog n barrier for solvable-group isomorphism
2013
David J. Rosenbaum
+
PDF
Chat
Analysis of an Exhaustive Search Algorithm in Random Graphs and the $n^{c\log n}$-Asymptotics
2014
Cyril Banderier
HsienâKuei Hwang
Vlady Ravelomanana
Vytas Zacharovas
+
Bidirectional Collision Detection and Faster Deterministic Isomorphism Testing
2013
David J. Rosenbaum
+
Beating the Generator-Enumeration Bound for $p$-Group Isomorphism
2013
David J. Rosenbaum
Fabian Wagner
+
Search Problems in Trees with Symmetries: near optimal traversal strategies for individualization-refinement algorithms
2020
Markus Anders
Pascal Schweitzer
Works Cited by This (22)
Action
Title
Year
Authors
+
An Introduction to the Theory of Groups
1965
Joseph Rotman
+
SOLVABILITY OF GROUPS OF ODD ORDER
2012
Walter Feit
John G. Thompson
John G. Thompson
+
Polynomial-Time Isomorphism Test for Groups with No Abelian Normal Subgroups
2012
LĂĄszlĂł Babai
Paolo Codenotti
Youming Qiao
+
Canonical labeling of graphs
1983
LĂĄszlĂł Babai
Eugene M. Luks
+
Isomorphism of graphs of bounded valence can be tested in polynomial time
1982
Eugene M. Luks
+
Polynomial-time versions of Sylow's theorem
1988
William M. Kantor
D. E. Taylor
+
Generation of classical groups
1994
Gunter Malle
Jan Saxl
Thomas Weigel
+
A MILLENNIUM PROJECT: CONSTRUCTING SMALL GROUPS
2002
Hans Ulrich Besche
Bettina Eick
E. A. OâBrien
+
Graph isomorphism, general remarks
1979
Gary L. Miller
+
AnO(n) Algorithm for Abelianp-Group Isomorphism and anO(nlogn) Algorithm for Abelian Group Isomorphism
1996
Narayan Vikas