On the Additive Complexity of Matrix Multiplication
From MaRDI portal
Publication:4094310
DOI10.1137/0205016zbMath0328.65029OpenAlexW2055569999MaRDI QIDQ4094310
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
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (9)
On the arithmetic complexity of Strassen-like matrix multiplications ⋮ Towards Practical Fast Matrix Multiplication based on Trilinear Aggregation ⋮ Pebbling Game and Alternative Basis for High Performance Matrix Multiplication ⋮ Fast matrix multiplication and its algebraic neighbourhood ⋮ On the additive complexity of 2 \(\times 2\) matrix multiplication ⋮ Improved method for finding optimal formulas for bilinear maps in a finite field ⋮ Untersuchungen des Zeitgewinns durch neue Algorithmen zur Matrix- Multiplikation ⋮ Commutativity, non-commutativity, and bilinearity ⋮ A fast algorithm for reversion of power series
This page was built for publication: On the Additive Complexity of Matrix Multiplication
