On the Reuse of Additions in Matrix Multiplication

DOI10.1137/S0097539793251761MaRDI QIDQ4862798zbMATH OpenFDO

Authors

Publication date 25 February 1996

Published in SIAM Journal on Computing (Search for Journal in Brave)

zbMATH Keywords

algebraic complexity theoryreuse

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Parallel algorithms in computer science (68W10)

Recommendations

• An optimal algorithm for matrix multiplication
• On practical algorithms for accelerated matrix multiplication
• A Lower Bound for Matrix Multiplication
• The bilinear complexity and practical algorithms for matrix multiplication
• Matrix multiplication via arithmetic progressions

Cited in

(3)

• Cascade Addition and Subtraction of Matrices
• New and old results in resultant theory
• Addition requirements for matrix and transposed matrix products

This page was built for publication: On the Reuse of Additions in Matrix Multiplication

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