Computing the structure of a finite abelian group

DOI10.1090/S0025-5718-05-01740-0zbMath1089.20032MaRDI QIDQ5315431

Arthur Schmidt, Johannes A. Buchmann

Publication date: 8 September 2005

Published in: Mathematics of Computation (Search for Journal in Brave)

zbMATH Keywords

algorithmsfinite Abelian groupsnumbers of generatorscomplexity boundsorders of elements

Mathematics Subject Classification ID

Related Items (12)

EFFICIENT ALGORITHMS FOR THE BASIS OF FINITE ABELIAN GROUPS ⋮ On isomorphism testing of groups with normal Hall subgroups ⋮ A Terr algorithm for computations in the infrastructure of real-quadratic number fields ⋮ On time-lock cryptographic assumptions in abelian hidden-order groups ⋮ Computing the binomial part of a polynomial ideal ⋮ An Algorithm for Computing a Basis of a Finite Abelian Group ⋮ Linear and sublinear time algorithms for the basis of abelian groups ⋮ A generic approach to searching for Jacobians ⋮ Structure computation and discrete logarithms in finite abelian $p$-groups ⋮ Computing Hilbert class polynomials with the Chinese remainder theorem ⋮ The infrastructure of a global field of arbitrary unit rank ⋮ COMPUTING NORMAL INTEGRAL BASES OF ABELIAN NUMBER FIELDS

Cites Work

• Asymptotically Fast Triangularization of Matrices over Rings
• On some computational problems in finite abelian groups
• A modification of Shanks' baby-step giant-step algorithm

This page was built for publication: Computing the structure of a finite abelian group