Sciweavers

Share
MOC
1998

A space efficient algorithm for group structure computation

9 years 10 months ago
A space efficient algorithm for group structure computation
We present a new algorithm for computing the structure of a finite abelian group, which has to store only a fixed, small number of group elements, independent of the group order. We estimate the computational complexity by counting the group operations such as multiplications and equality checks. Under some plausible assumptions, we prove that the expected run time is O( √ n) (with n denoting the group order), and we explicitly determine the Oconstants. We implemented our algorithm for ideal class groups of imaginary quadratic orders and present experimental results.
Edlyn Teske
Added 22 Dec 2010
Updated 22 Dec 2010
Type Journal
Year 1998
Where MOC
Authors Edlyn Teske
Comments (0)
books