Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4609046 | Journal of Complexity | 2007 | 41 Pages |
Abstract
In the vein of recent algorithmic advances in polynomial factorization 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.
Related Topics
Physical Sciences and Engineering
Mathematics
Analysis