Linear and sublinear time algorithms for basis of abelian groups

DOI10.1007/978-3-642-10631-6_51MaRDI QIDQ3652237zbMATH OpenOpenAlexFDO

Authors Li Chen, Bin Fu

Publication date 17 December 2009

Published in Algorithms and Computation (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Finite abelian groups (20K01) Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20)

Recommendations

• Linear and sublinear time algorithms for the basis of abelian groups
• Linear time algorithms for the basis of Abelian groups.
• Efficient algorithms for the basis of finite abelian groups
• An Algorithm for Computing a Basis of a Finite Abelian Group
• Analysis of algorithms on problems in general abelian groups

Cited in

(7)

• Analysis of algorithms on problems in general abelian groups
• Efficient algorithms for the basis of finite abelian groups
• Linear time algorithms for the basis of Abelian groups.
• Polynomial-time algorithms for finding elements of prime order and sylow subgroups
• scientific article; zbMATH DE number 1004940 (Why is no real title available?)
• Linear and sublinear time algorithms for the basis of abelian groups
• Cryptanalysis of some nonabelian group-based key exchange protocols

This page was built for publication: Linear and sublinear time algorithms for basis of abelian groups

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