Fast Multivariate Power Series Multiplication in Characteristic Zero

Autores/as

  • G. Lecerf Universit´e de Versailles, Francia
  • E. Schost Ecole polytechnique, Francia

Palabras clave:

Multivariate power series, fast multiplication, complexity

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.

Descargas

Publicado

2003-09-19

Cómo citar

Lecerf, G., & Schost, E. (2003). Fast Multivariate Power Series Multiplication in Characteristic Zero. SADIO Electronic Journal of Informatics and Operations Research, 5, 1-10. https://revistas.unlp.edu.ar/ejs/article/view/17526