analgorithmforcomputingthefactorringofanidealinadedekinddomainwithfiniterank
文献类型：期刊论文
| 作者 | Huang Dandan1; Deng Yingpu2
|
| 刊名 | sciencechinamathematics
 |
| 出版日期 | 2018 |
| 卷号 | 61期号:5页码:783 |
| ISSN号 | 1674-7283 |
| 英文摘要 | We give an algorithm for computing the factor ring of a given ideal in a Dedekind domain with finite rank,which runs in deterministic and polynomial time.We provide two applications of the algorithm:judging whether a given ideal is prime or prime power.The main algorithm is based on basis representation of finite rings which is computed via Hermite and Smith normal forms. |
| 语种 | 英语 |
| 源URL | [http://ir.amss.ac.cn/handle/2S8OKBNM/39058]  |
| 专题 | 系统科学研究所 |
| 作者单位 | 1.Department of Cyber Space Security,School of Software Engineering,Jinling Institute of Technology 2.中国科学院数学与系统科学研究院 |
| 推荐引用方式 GB/T 7714 | Huang Dandan,Deng Yingpu. analgorithmforcomputingthefactorringofanidealinadedekinddomainwithfiniterank[J]. sciencechinamathematics,2018,61(5):783. |
| APA | Huang Dandan,&Deng Yingpu.(2018).analgorithmforcomputingthefactorringofanidealinadedekinddomainwithfiniterank.sciencechinamathematics,61(5),783. |
| MLA | Huang Dandan,et al."analgorithmforcomputingthefactorringofanidealinadedekinddomainwithfiniterank".sciencechinamathematics 61.5(2018):783. |
入库方式： OAI收割
来源：数学与系统科学研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。