EFFICIENT ALGORITHMS FOR THE BASIS OF FINITE ABELIAN GROUPS

DOI10.1142/S1793830911001401zbMath1277.11115MaRDI QIDQ2905283

Gregory Karagiorgos, Dimitrios Poulakis

Publication date: 27 August 2012

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

zbMATH Keywords

order; abelian group; basis of abelian group; generating system; deterministic linear algorithms

Mathematics Subject Classification ID

68W05: Nonnumerical algorithms

11Y16: Number-theoretic algorithms; complexity

20K01: Finite abelian groups

Related Items

Nearly linear time isomorphism algorithms for some nonabelian group classes, Compact data structures for Dedekind groups and finite rings, A Digital Signature Scheme Based on Two Hard Problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• Linear time algorithms for Abelian group isomorphism and related problems
• 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
• A Survey of Public-Key Cryptosystems
• Computing the structure of a finite abelian group