The complexity of bivariate power series arithmetic.
type: Item
instance of: scholarly article
title: The complexity of bivariate power series arithmetic.
zbMATH Open document ID: 1057.68040
DOI: 10.1016/S0304-3975(02)00396-1
author: Markus Bläser
published in: Theoretical Computer Science
publication date: 2003-08-17T00:00:00Z
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 1965266
zbMATH Keywords: multiplicative complexity
MaRDI profile type: Publication
cites work: On the algorithmic complexity of associative algebras
cites work: Q4535011
cites work: Q4331740
cites work: Q4300259
cites work: Lectures on the complexity of bilinear problems
cites work: Commutative algebras of minimal rank
cites work: Inverting Polynomials and Formal Power Series
cites work: On computing reciprocals of power series
cites work: Q4352784
cites work: Q4047029
description: scientific article; zbMATH DE number 1965266