LIFTING AND RECOMBINATION TECHNIQUES
For Absolute Factorization · 2005
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.