On the Number of Multiplications Required for Matrix Multiplication

DOI10.1137/0205041MaRDI QIDQ4114690zbMATH OpenOpenAlexWikidataFDO

Authors 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

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

Cited in

(13)

• Extending the four Russians' bound to general matrix multiplication
• On the asymptotic complexity of rectangular matrix multiplication
• A lower bound for the multiplication of polynomials modulo a polynomial
• 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
• On the inequivalence of bilinear algorithms for \(3\times 3\) matrix multiplication
• A noncommutative algorithm for multiplying 3×3 matrices using 23 multiplications
• Fast matrix multiplication and its algebraic neighbourhood
• On the arithmetic complexity of matrix Kronecker powers
• The Mailman algorithm: a note on matrix-vector multiplication

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

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