<?xml version="1.0" encoding="UTF-8"?>
<feed xmlns="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/">
<title>Volumen 05</title>
<link href="http://sedici.unlp.edu.ar:80/handle/10915/134632" rel="alternate"/>
<subtitle/>
<id>http://sedici.unlp.edu.ar:80/handle/10915/134632</id>
<updated>2026-03-13T20:18:09Z</updated>
<dc:date>2026-03-13T20:18:09Z</dc:date>
<entry>
<title>Fast Multivariate Power Series Multiplication in Characteristic Zero</title>
<link href="http://sedici.unlp.edu.ar:80/handle/10915/135308" rel="alternate"/>
<author>
<name>Lecerf, G.</name>
</author>
<author>
<name>Schost, E.</name>
</author>
<id>http://sedici.unlp.edu.ar:80/handle/10915/135308</id>
<updated>2022-04-29T20:02:53Z</updated>
<published>2003-06-26T00:00:00Z</published>
<summary type="text">Articulo
Electronic Journal of SADIO; vol. 5
Let k be a field of characteristic zero. We present a fast algorithm formultiplying multivariate power series over k truncated in total degree. Upto logarithmic factors, its complexity is optimal, i.e. linear in the numberof coeffcients of the series.Keywords. Multivariate power series, fast multiplication, complexity.
</summary>
<dc:date>2003-06-26T00:00:00Z</dc:date>
<dc:description>Let k be a field of characteristic zero. We present a fast algorithm formultiplying multivariate power series over k truncated in total degree. Upto logarithmic factors, its complexity is optimal, i.e. linear in the numberof coeffcients of the series.Keywords. Multivariate power series, fast multiplication, complexity.</dc:description>
</entry>
</feed>
