analgorithmforcomputingthefactorringofanidealinadedekinddomainwithfiniterank

CSpace > 系统科学研究所

	analgorithmforcomputingthefactorringofanidealinadedekinddomainwithfiniterank
	Huang Dandan 1; Deng Yingpu2
	2018
发表期刊	sciencechinamathematics
ISSN	1674-7283
卷号	61 期号:5 页码:783
摘要	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.
语种	英语
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/39059
专题	系统科学研究所
作者单位	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.