Fast Multivariate Power Series Multiplication in Characteristic Zero

  • G. Lecerf Laboratoire de Math´ematiques, Universit´e de Versailles
  • E. Schost Laboratoire GAGE, Ecole polytechnique

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.

Publicado
2003-09-19
Cómo citar
Lecerf, G., & Schost, E. (2003). Fast Multivariate Power Series Multiplication in Characteristic Zero. Electronic Journal of SADIO (EJS), 5(1), 1-10. Recuperado a partir de https://ojs.sadio.org.ar/index.php/EJS/article/view/105