Computing the structure of a finite abelian group

DOI10.1090/S0025-5718-05-01740-0MaRDI QIDQ5315431zbMATH OpenFDO

Authors Arthur Schmidt, Johannes Buchmann

Publication date 8 September 2005

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

Full work available at URL https://doi.org/10.1090/S0025-5718-05-01740-0

zbMATH Keywords

algorithmscomplexity boundsfinite Abelian groupsnumbers of generatorsorders of elements

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Finite abelian groups (20K01) Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)

Recommendations

• An Algorithm for Computing a Basis of a Finite Abelian Group
• A space efficient algorithm for group structure computation
• Efficient algorithms for the basis of finite abelian groups
• scientific article; zbMATH DE number 1257081
• Analysis of algorithms on problems in general abelian groups

Cites work

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

Cited in

(22)

• Computing a basis for a finite Abelian p-group
• Determining concepts by group membership
• On isomorphism testing of groups with normal Hall subgroups
• A Terr algorithm for computations in the infrastructure of real-quadratic number fields
• Efficient algorithms for the basis of finite abelian groups
• Succinct representation of finite abelian groups
• An Algorithm for Computing a Basis of a Finite Abelian Group
• Worst-Case Complexity Bounds on Algorithms for Computing the Canonical Structure of Infinite Abelian Groups and Solving Systems of Linear Diophantine Equations
• 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
• GAP algorithms for finite Abelian groups and applications.
• Factoring Groups Efficiently
• On some computational problems in finite abelian groups
• Computing normal integral bases of abelian number fields
• Subgroup lattice algorithms related to extending and lifting Abelian groups.
• Computer Algebra in Scientific Computing
• Linear and sublinear time algorithms for the basis of abelian groups
• On time-lock cryptographic assumptions in abelian hidden-order groups
• Computing the binomial part of a polynomial ideal
• Unconditional computation of the class groups of real quadratic fields

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5315431)