Group isomorphism is nearly-linear time for most orders

Heiko Dietrich, James B. Wilson

We show that there is a dense set $\ourset\subseteq \mathbb{N}$ of group orders and a constant $c$ such that for every $n\in \ourset$ we can decide in time $O(n^2(\log n{)}^c)$ wheth…