%0 Journal Article
%T Optimal Algorithm for Algebraic Factoring
%A Zhi Lihong
%A <br>Zhi
%A Lihong
%J 计算机科学技术学报
%D 1997
%I 
%X 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.
%K Hensel lemma
%K integer substitution
%K ascending set
%K algebraic extensions field<br>最优算法
%K 多变数多项式
%K 代数因子化
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=F57FEF5FAEE544283F43708D560ABF1B&aid=8CCAFB999F17078BE656F87F48631797&yid=5370399DC954B911&vid=59906B3B2830C2C5&iid=CA4FD0336C81A37A&sid=CA4FD0336C81A37A&eid=9CF7A0430CBB2DFD&journal_id=1000-9000&journal_name=计算机科学技术学报&referenced_num=0&reference_num=6