| 一个可换p群分解为循环p群的直积的算法 |
| |
| 引用本文： | 邹潇湘,刘任任.一个可换p群分解为循环p群的直积的算法[J].湘潭大学自然科学学报,1999,21(1):23-26,32. |
| |
| 作者姓名： | 邹潇湘 刘任任 |
| |
| 作者单位： | 湘潭大学计算机科学系 |
| |
| 摘 要： | 设Ｇ为可换群，｜Ｇ｜ｐ＾ｍ（ｐ为质数）。本文给出了一个将Ｇ分解为循环ｐ群的直积的算法，其时间复杂度为Ｑ「（ｎｌｏｇｎ）＾２」，ｎ＝ｐ＾ｍ。
|
| 关 键 词： | p群 直积 算法 分解 交换群 循环群 有限群 |
AN ALGORITHM OF DECOMPOSING FINITE ABELIAN p GROUP INTO DIRECT PRODUCTS OF
CYCLIC p GROUP |
| |
| Zou Xiaoxiang,Liu Renren.AN ALGORITHM OF DECOMPOSING FINITE ABELIAN p GROUP INTO DIRECT PRODUCTS OF
CYCLIC p GROUP[J].Natural Science Journal of Xiangtan University,1999,21(1):23-26,32. |
| |
| Authors: | Zou Xiaoxiang Liu Renren |
| |
| Abstract: | 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. |
| |
| Keywords: | p group direct procucts algorithm |
| 本文献已被 CNKI 维普 等数据库收录！ |
|
