Campuses:

factorization

Wednesday, April 18, 2007 - 1:30pm - 2:20pm
Grégoire Lecerf (Université Versailles/Saint Quentin-en-Yvelines)
I will present new deterministic and probabilistic
recombination
algorithms to compute the irreducible factorization of
bivariate
polynomials via the classical Hensel lifting technique, and for
the
dense representation model. In bi-degree (dx,
dy) with dy
dx, and whatever the characteristic of the base field is,
these algorithms only require the precision of the lifting to be
dx+1. The cost of the deterministic recombination algorithm
Subscribe to RSS - factorization