FFT-like Multiplication of Linear Differ
β
Joris Van Der Hoeven
π
Article
π
2002
π
Elsevier Science
π
English
β 214 KB
It is well known that integers or polynomials can be multiplied in an asymptotically fast way using the discrete Fourier transform. In this paper, we give an analogue of fast Fourier multiplication in the ring of skew polynomials C[x, Ξ΄], where Ξ΄ = x β βx . More precisely, we show that the multiplic