Details:
Title  Singlefactor lifting and factorization of polynomials over local fields  Author(s)  Jordi Guàrdia, Enric Nart, Sebastian Pauli  Type  Article in Journal  Abstract  Let f ( x ) be a separable polynomial over a local field. The Montes algorithm computes certain approximations to the different irreducible factors of f ( x ) , with strong arithmetic properties. In this paper, we develop an algorithm to improve any one of these approximations, till a prescribed precision is attained. The most natural application of this “singlefactor lifting” routine is to combine it with the Montes algorithm to provide a fast polynomial factorization algorithm. Moreover, the singlefactor lifting algorithm may be applied as well to accelerate the computational resolution of several global arithmetic problems in which the improvement of an approximation to a single local irreducible factor of a polynomial is required.  Keywords  Local field, Montes algorithm, Montes approximation, Newton polygon, Okutsu approximation, Polynomial factorization  ISSN  07477171 
URL 
http://www.sciencedirect.com/science/article/pii/S0747717112000363 
Language  English  Journal  Journal of Symbolic Computation  Volume  47  Number  11  Pages  1318  1346  Year  2012  Edition  0  Translation 
No  Refereed 
No 
