一个可换p群分解为循环p群的直积的算法

AN ALGORITHM OF DECOMPOSING FINITE ABELIAN p GROUP INTO DIRECT PRODUCTS OF CYCLIC p GROUP

设Ｇ为可换群，｜Ｇ｜＝ｐｍ（ｐ为质数）．本文给出了一个将Ｇ分解为循环ｐ群的直积的算法，其时间复杂度为Ｑ［（ｎｌｏｇｎ）２］，ｎ＝ｐｍ．

In this paper, a new algorithm is presented, which is the implement of the theory that a finite abelian p group can be decomposed into direct products of cyclic p group.