The complexity of bivariate power series arithmetic.

DOI10.1016/S0304-3975(02)00396-1zbMath1057.68040MaRDI QIDQ1401232

Markus Bläser

Publication date: 17 August 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

multiplicative complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (1)

Beyond the Alder-Strassen bound.

Cites Work

• Commutative algebras of minimal rank
• Lectures on the complexity of bilinear problems
• On the algorithmic complexity of associative algebras
• On computing reciprocals of power series
• Inverting Polynomials and Formal Power Series
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The complexity of bivariate power series arithmetic.