%0 Journal Article
%T The Application of Chinese Remainder Algorithm in the Acquisition of the Greatest Common Divisor from Multivariate Polynomial<br>中国剩余算法在多元多项式最大公因式提取中的应用
%A YANG Ning-xue
%A ZHU Chang-qian
%A GONG Hui
%A <br>杨宁学
%A 诸昌钤
%A 龚晖
%J 计算机科学
%D 2005
%I 
%X The application of Chinese Remainder Algorithm to determine the greatest common divisor of multivariate polynomials is studied Using homostasis mapping, a multivariate polynondal is simplified step by step until only one main variable is left, and the greatest common divisor of the single variable polynomial is obtained by the extended Euclid Algorithm. Then, using the Chinese Remainder Algorithm raises the greatest common divisor from one vari- able to the original multivariate until the real greatest common divisor is gotten. It is an efficient algorithm to solve the greatest coanon divisor of multivariate polynomials.
%K Chinese remainder theorem
%K Multivariate polynomial
%K Greatest common divisor
%K Homostasis mapping<br>中国剩余定理
%K 多元多项式
%K 最大公因式
%K 同态映射
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=64A12D73428C8B8DBFB978D04DFEB3C1&aid=CB429C100624D4DB&yid=2DD7160C83D0ACED&vid=9971A5E270697F23&iid=B31275AF3241DB2D&sid=CA5852BD1A173B3A&eid=F8035C8B7D8A4264&journal_id=1002-137X&journal_name=计算机科学&referenced_num=0&reference_num=8