Sciweavers

AAECC
2008
Springer
83views Algorithms» more  AAECC 2008»
13 years 5 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 ...
Grégoire Lecerf