The lower bounds on the additive complexity of bilinear problems in terms of some algebraic quantities

DOI10.1016/0020-0190(81)90035-1zbMath0469.68047OpenAlexW2111083410MaRDI QIDQ1157165

Pan, Victor Y.

Publication date: 1981

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(81)90035-1

zbMATH Keywords

tensor rankbilinear algorithmslogical complexity of arithmetic algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical linear algebra (65F99)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Addition Requirements for Rational Functions
• Note on a Lower Bound on the Linear Complexity of the Fast Fourier Transform

This page was built for publication: The lower bounds on the additive complexity of bilinear problems in terms of some algebraic quantities