An Algorithm for Computing a Basis of a Finite Abelian Group

DOI10.1007/978-3-642-21493-6_11zbMath1280.20057MaRDI QIDQ3014939

Dimitrios Poulakis, Gregory Karagiorgos

Publication date: 8 July 2011

Published in: Algebraic Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-21493-6_11

zbMATH Keywords

deterministic algorithms; finite abelian groups; generating systems; bases of abelian groups

Mathematics Subject Classification ID

68W05: Nonnumerical algorithms

20F05: Generators, relations, and presentations of groups

11Y16: Number-theoretic algorithms; complexity

20K01: Finite abelian groups

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear and sublinear time algorithms for the basis of abelian groups
• Analysis of algorithms on problems in general abelian groups
• Computing a basis for a finite Abelian p-group
• The Pohlig-Hellman method generalized for group structure computation
• Worst-Case Complexity Bounds on Algorithms for Computing the Canonical Structure of Finite Abelian Groups and the Hermite and Smith Normal Forms of an Integer Matrix
• A space efficient algorithm for group structure computation
• Quantum computations: algorithms and error correction
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• A Survey of Public-Key Cryptosystems
• Computing the structure of a finite abelian group
• Computer Algebra in Scientific Computing