EFFICIENT ALGORITHMS FOR THE BASIS OF FINITE ABELIAN GROUPS
Gregory Karagiorgos, Dimitrios Poulakis · Discrete Mathematics Algorithms and Applications · 2011
In this paper we consider the problem of computation of a basis for an abelian group G with N elements such that the prime factorization of N is known. We present two deterministic algorithms for this task and a deterministic algorithm in case where a generating system for G is given.