Sciweavers

AAECC
2008
Springer

Fast separable factorization and applications

13 years 6 months ago
Fast separable factorization and applications
Abstract. In this paper we show that the separable decomposition of a univariate polynomial can be computed in softly optimal time, in terms of the number of arithmetic operations in the coefficient field. We also adapt the classical multi-modular strategy that speeds up the computations for many coefficient fields, and we analyze consequences of the new results to the squarefree and the irreducible factorizations.
Grégoire Lecerf
Added 08 Dec 2010
Updated 08 Dec 2010
Type Journal
Year 2008
Where AAECC
Authors Grégoire Lecerf
Comments (0)