Linear and Sublinear Time Algorithms for Basis of Abelian Groups

It is well known that every finite abelian group G can be represented as a direct product of cyclic groups: G ∼= G1 × G2 × · · · × Gt, where each Gi is a cyclic group of order pj for some prime p and

• Type: Conference
• Year: 2009
• Where: ISAAC
• Authors: Li Chen, Bin Fu
• Keywords: Algorithms, Cyclic Group, ISAAC 2009, finite Abelian Group