, where
. More precisely, we show
that the multiplication problem of linear differential operators of
degree 
in 
and degree
in 
can be reduced to the
matrix multiplication
problem.
| HomepagePublicationsTalksTeXmacsMathemagix |
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 , where
. More precisely, we show
that the multiplication problem of linear differential operators of
degree in and degree
in can be reduced to the
matrix multiplication
problem.