The complexity of bivariate power series arithmetic.

DOI10.1016/S0304-3975(02)00396-1zbMATH Open1057.68040MaRDI QIDQ1401232FDOQ1401232

Authors: Markus Bläser 

Publication date: 17 August 2003

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

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

zbMATH Keywords

multiplicative complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• On computing reciprocals of power series
• Title not available (Why is that?)
• Lectures on the complexity of bilinear problems
• On the algorithmic complexity of associative algebras
• Commutative algebras of minimal rank
• Inverting Polynomials and Formal Power Series
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (6)

• Title not available (Why is that?)
• Title not available (Why is that?)
• The middle product algorithm. I: Speeding up the division and square root of power series
• Beyond the Alder-Strassen bound.
• Multivariate power series multiplication
• Fast multivariate power series multiplication in characteristic zero

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)