LIFTING AND RECOMBINATION TECHNIQUES FOR ABSOLUTE FACTORIZATION
Egoire Lecerf · 2007
In the vein of recent algorithmic advances in polynomial factor- ization based on lifting and recombination techniques, we present new faster algorithms for computing the absolute factorization of a bivariate polynomial. The running time of our probabilistic algorithm is less than quadratic in the dense size of the polynomial to be factored.