An Algorithm for Computing a Basis of a Finite Abelian Group

DOI10.1007/978-3-642-21493-6_11MaRDI QIDQ3014939zbMATH OpenOpenAlexFDO

Authors Gregory Karagiorgos, Dimitros Poulakis

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

bases of abelian groupsdeterministic algorithmsfinite abelian groupsgenerating systems

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Generators, relations, and presentations of groups (20F05) Finite abelian groups (20K01) Nonnumerical algorithms (68W05)

Recommendations

• Efficient algorithms for the basis of finite abelian groups
• Computing a basis for a finite Abelian p-group
• Linear time algorithms for the basis of Abelian groups.
• Computing the structure of a finite abelian group
• scientific article; zbMATH DE number 1257081
• Algorithmic methods for finitely generated Abelian groups
• A computer algebra solution to a problem in finite groups.
• scientific article; zbMATH DE number 3855240
• An algorithm for constructing representations of finite groups.
• Linear and sublinear time algorithms for the basis of abelian groups

Cites work

• A space efficient algorithm for group structure computation
• A Survey of Public-Key Cryptosystems
• Analysis of algorithms on problems in general abelian groups
• Computer Algebra in Scientific Computing
• Computing a basis for a finite Abelian p-group
• Computing the structure of a finite abelian group
• Decomposing finite Abelian groups
• scientific article; zbMATH DE number 1643940 (Why is no real title available?)
• scientific article; zbMATH DE number 5485539 (Why is no real title available?)
• scientific article; zbMATH DE number 3657869 (Why is no real title available?)
• scientific article; zbMATH DE number 3445454 (Why is no real title available?)
• Linear and sublinear time algorithms for the basis of abelian groups
• Modern computer algebra
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Quantum computations: algorithms and error correction
• 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

Cited in

(10)

• Computing a basis for a finite Abelian p-group
• Isomorphism testing of groups of cube-free order
• Efficient algorithms for the basis of finite abelian groups
• Linear time algorithms for the basis of Abelian groups.
• Factoring Groups Efficiently
• Linear and sublinear time algorithms for basis of abelian groups
• Computing the structure of a finite abelian group
• scientific article; zbMATH DE number 2190890 (Why is no real title available?)
• Computer Algebra in Scientific Computing
• Linear and sublinear time algorithms for the basis of abelian groups

This page was built for publication: An Algorithm for Computing a Basis of a Finite Abelian Group

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