Fast Multivariate Power Series Multiplication in Characteristic Zero

Resumen

Let k be a field of characteristic zero. We present a fast algorithm for
multiplying multivariate power series over k truncated in total degree. Up
to logarithmic factors, its complexity is optimal, i.e. linear in the number
of coeffcients of the series.
Keywords. Multivariate power series, fast multiplication, complexity.