The complexity of bivariate power series arithmetic.

DOI10.1016/S0304-3975(02)00396-1MaRDI QIDQ1401232zbMATH OpenFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 1834648
• Inverting Polynomials and Formal Power Series
• Multivariate power series multiplication
• Variations on computing reciprocals of power series
• Fast algorithms for elementary operations on complex power series

Cites work

• scientific article; zbMATH DE number 3461412 (Why is no real title available?)
• scientific article; zbMATH DE number 612882 (Why is no real title available?)
• scientific article; zbMATH DE number 976329 (Why is no real title available?)
• scientific article; zbMATH DE number 1057738 (Why is no real title available?)
• scientific article; zbMATH DE number 1754586 (Why is no real title available?)
• Commutative algebras of minimal rank
• Inverting Polynomials and Formal Power Series
• Lectures on the complexity of bilinear problems
• On computing reciprocals of power series
• On the algorithmic complexity of associative algebras

Cited in

(6)

• Beyond the Alder-Strassen bound.
• scientific article; zbMATH DE number 4033074 (Why is no real title available?)
• Fast multivariate power series multiplication in characteristic zero
• Multivariate power series multiplication
• scientific article; zbMATH DE number 1834648 (Why is no real title available?)
• The middle product algorithm. I: Speeding up the division and square root of power series

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1401232)