Sciweavers

97
Voted
AAECC
2008
Springer
83views Algorithms» more  AAECC 2008»
14 years 11 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