On the Number of Multiplications Required for Matrix Multiplication

DOI10.1137/0205041zbMath0345.65011OpenAlexW2082748376WikidataQ114074409 ScholiaQ114074409MaRDI QIDQ4114690

Roger W. Brockett, David P. Dobkin

Publication date: 1976

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

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (14)

An improved combinatorial algorithm for Boolean matrix multiplication ⋮ On the arithmetic complexity of matrix Kronecker powers ⋮ Extending the four Russians' bound to general matrix multiplication ⋮ Fast matrix multiplication and its algebraic neighbourhood ⋮ On the inequivalence of bilinear algorithms for \(3\times 3\) matrix multiplication ⋮ On the asymptotic complexity of rectangular matrix multiplication ⋮ A noncommutative algorithm for multiplying 3×3 matrices using 23 multiplications ⋮ A lower bound for the multiplication of polynomials modulo a polynomial ⋮ The Mailman algorithm: a note on matrix-vector multiplication ⋮ More factors than subjects, tests and treatments: An indeterminacy theorem for canonical decomposition and individual differences scaling ⋮ Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics ⋮ Some elementary proofs of lower bounds in complexity theory ⋮ On the optimal evaluation of a set of bilinear forms ⋮ Fast rectangular matrix multiplication and applications

This page was built for publication: On the Number of Multiplications Required for Matrix Multiplication