Optimal Algorithm for Algebraic Factoring  

作　　者：支丽红 

出　　处：《Journal of Computer Science & Technology》1997年第1期1-9,共9页计算机科学技术学报（英文版）

摘　　要：This paper presents an 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 substitutions. Then factorize the univariate polynomials over the algebraic number fields. Finally, construct multivariate factors of the original polynomial by Hensel lemma and TRUEFACTOR test. Some examples with timing are included.This paper presents an 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 substitutions. Then factorize the univariate polynomials over the algebraic number fields. Finally, construct multivariate factors of the original polynomial by Hensel lemma and TRUEFACTOR test. Some examples with timing are included.

关 键 词：Hensel lemma integer substitution ascending set algebraic extensions field 

分 类 号：O174.2[理学—数学] TP301.6[理学—基础数学]