Efficient algorithms for the basis of finite abelian groups

DOI10.1142/S1793830911001401MaRDI QIDQ2905283zbMATH OpenOpenAlexFDO

Authors Gregory Karagiorgos, Dimitros 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

abelian groupbasis of abelian groupdeterministic linear algorithmsgenerating systemorder

Mathematics Subject Classification ID

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

Recommendations

• Linear and sublinear time algorithms for the basis of abelian groups
• Linear and sublinear time algorithms for basis of abelian groups
• scientific article; zbMATH DE number 1257081
• Linear time algorithms for the basis of Abelian groups.
• Algorithmic methods for finitely generated Abelian groups
• An Algorithm for Computing a Basis of a Finite Abelian Group
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• On some computational problems in finite abelian groups
• Computing a basis for a finite Abelian p-group
• Computer Algebra in Scientific Computing

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
• Computing a basis for a finite Abelian p-group
• Computing the structure of a finite abelian group
• 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 time algorithms for Abelian group isomorphism and related problems
• Modern computer algebra
• 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

(18)

• Analysis of algorithms on problems in general abelian groups
• Computing a basis for a finite Abelian p-group
• Compact data structures for Dedekind groups and finite rings
• A digital signature scheme based on two hard problems
• Succinct representation of finite abelian groups
• An Algorithm for Computing a Basis of a Finite Abelian Group
• Linear time algorithms for the basis of Abelian groups.
• GAP algorithms for finite Abelian groups and applications.
• Factoring Groups Efficiently
• Linear and sublinear time algorithms for basis of abelian groups
• scientific article; zbMATH DE number 4092675 (Why is no real title available?)
• scientific article; zbMATH DE number 56705 (Why is no real title available?)
• scientific article; zbMATH DE number 1257081 (Why is no real title available?)
• 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
• Nearly linear time isomorphism algorithms for some nonabelian group classes

This page was built for publication: Efficient algorithms for the basis of finite abelian groups

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