On the Additive Complexity of Matrix Multiplication

DOI10.1137/0205016MaRDI QIDQ4094310zbMATH OpenOpenAlexFDO

Authors Robert L. Probert

Publication date 1976

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

Full work available at URL https://doi.org/10.1137/0205016

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)

Cited in

(10)

• Untersuchungen des Zeitgewinns durch neue Algorithmen zur Matrix- Multiplikation
• Commutativity, non-commutativity, and bilinearity
• Improved method for finding optimal formulas for bilinear maps in a finite field
• On the arithmetic complexity of Strassen-like matrix multiplications
• Fast matrix multiplication and its algebraic neighbourhood
• A fast algorithm for reversion of power series
• Towards Practical Fast Matrix Multiplication based on Trilinear Aggregation
• Pebbling Game and Alternative Basis for High Performance Matrix Multiplication
• On the additive complexity of 2 \(\times 2\) matrix multiplication
• Alternative basis matrix multiplication is fast and \(\mathrm{stable}^\dag\)

This page was built for publication: On the Additive Complexity of Matrix Multiplication

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