EFFICIENT ALGORITHMS FOR THE BASIS OF FINITE ABELIAN GROUPS

DOI10.1142/S1793830911001401zbMath1277.11115OpenAlexW2014564193MaRDI QIDQ2905283

Gregory Karagiorgos, Dimitrios Poulakis

Publication date: 27 August 2012

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

Full work available at URL: https://doi.org/10.1142/s1793830911001401

zbMATH Keywords

orderabelian groupbasis of abelian groupgenerating systemdeterministic linear algorithms

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Number-theoretic algorithms; complexity (11Y16) Finite abelian groups (20K01)

Related Items (3)

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

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: EFFICIENT ALGORITHMS FOR THE BASIS OF FINITE ABELIAN GROUPS