<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:dc="http://purl.org/dc/elements/1.1/" version="2.0">
<channel>
<title>Volumen 05</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/134632</link>
<description/>
<pubDate>Thu, 12 Nov 2026 09:51:21 GMT</pubDate>
<dc:date>2026-11-12T09:51:21Z</dc:date>
<item>
<title>Fast Multivariate Power Series Multiplication in Characteristic Zero</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/135308</link>
<description>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.
</description>
<pubDate>Thu, 26 Jun 2003 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/135308</guid>
<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>
</item>
</channel>
</rss>
