optimalalgorithmforalgebraicfactoring

CSpace > 系统科学研究所

	optimalalgorithmforalgebraicfactoring
	Zhi LH(支丽红)
	1997
发表期刊	journalofcomputerscienceandtechnology
ISSN	1000-9000
卷号	012 期号:001 页码:1
摘要	This paper presents on optimized method for factoring multivariate polynomials over algebraic extension fields defined by an irreducible ascending set. The basic idea is to convert multivariate polynomials to univariate polynomials and algebraic extension fields to algebraic number fields by suitable integer substituteions.Then factorize the univariate polynomials over the algebraic number fields.Finally,construct mulativariate factors of the original polynomial by Hensel lemma and TRUEFACTOR test.Some examples with timing are included.
语种	英语
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/47975
专题	系统科学研究所
作者单位	中国科学院数学与系统科学研究院
推荐引用方式 GB/T 7714	Zhi LH. optimalalgorithmforalgebraicfactoring[J]. journalofcomputerscienceandtechnology,1997,012(001):1.
APA	支丽红.(1997).optimalalgorithmforalgebraicfactoring.journalofcomputerscienceandtechnology,012(001),1.
MLA	支丽红."optimalalgorithmforalgebraicfactoring".journalofcomputerscienceandtechnology 012.001(1997):1.