Details:
Title  An efficient algorithm for factoring polynomials over algebraic extension field.  Author(s)  Yao Sun, Dongming Wang  Type  Article in Journal  Abstract  An efficient algorithm is proposed for factoring polynomials over an algebraic extension field defined by a polynomial ring modulo a maximal ideal. If the maximal ideal is given by its Gröbner basis, no extra Gröbner basis computation is needed for factoring a polynomial over this extension field. Nothing more than linear algebraic technique is used to get a characteristic polynomial of a generic linear map. Then this polynomial is factorized over the ground field. From its factors, the factorization of the polynomial over the extension field is obtained. The algorithm has been implemented in Magma and computer experiments indicate that it is very efficient, particularly for complicated examples.  Keywords  algorithm, factorization, algebraic extension field  ISSN  16747283; 18691862/e 
URL 
http://link.springer.com/article/10.1007%2Fs1142501345860 
Language  English  Journal  Sci. China, Math.  Volume  56  Number  6  Pages  11551168  Publisher  Springer, Berlin/Heidelberg; Science in China Press, Beijing  Year  2013  Edition  0  Translation 
No  Refereed 
No 
