On Minimizing the Number of Multiplications Necessary for Matrix Multiplication

DOI10.1137/0120004zbMath0215.55501OpenAlexW1986272312WikidataQ114074417 ScholiaQ114074417MaRDI QIDQ5618880

L. R. Kerr, John E. Hopcrofts

Publication date: 1971

Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://hdl.handle.net/1813/5902

Mathematics Subject Classification ID

Related Items (47)

Gaussian elimination is optimal for solving linear equations in dimension two ⋮ A Counterexample to Comon's Conjecture ⋮ Fast commutative matrix algorithms ⋮ Complexities of special matrix multiplication problems ⋮ An introduction to the computational complexity of matrix multiplication ⋮ The bilinear complexity and practical algorithms for matrix multiplication ⋮ Unnamed Item ⋮ On varieties of optimal algorithms for the computation of bilinear mappings. I. The isotropy group of a bilinear mapping ⋮ Geometry and the complexity of matrix multiplication ⋮ Skew-polynomial-sparse matrix multiplication ⋮ On the complexity of the multiplication of matrices of small formats ⋮ Towards Practical Fast Matrix Multiplication based on Trilinear Aggregation ⋮ Flip Graphs for Matrix Multiplication ⋮ The approximate bilinear complexity of the multiplication of matrices of sizes \(2\times n\) and \(n\times 4\) ⋮ Pebbling Game and Alternative Basis for High Performance Matrix Multiplication ⋮ Tensor surgery and tensor rank ⋮ The tensor rank of tensor product of two three-qubit W states is eight ⋮ Tensor rank is not multiplicative under the tensor product ⋮ More on Tensors with Different Rank and Symmetric Rank ⋮ On the algorithmic complexity of associative algebras ⋮ Fast matrix multiplication and its algebraic neighbourhood ⋮ Dual problems of multiplication of a vector by a matrix ⋮ On the inequivalence of bilinear algorithms for \(3\times 3\) matrix multiplication ⋮ On the exact and approximate bilinear complexities of multiplication of \(4\times 2\) and \(2\times 2\) matrices ⋮ A noncommutative algorithm for multiplying 3×3 matrices using 23 multiplications ⋮ An extended duality theorem and multiplication of several matrices ⋮ Optimization techniques for small matrix multiplication ⋮ Fast modular transforms ⋮ Complexity of monotone networks for Boolean matrix product ⋮ A survey of techniques in applied computational complexity ⋮ 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 ⋮ An adaptive prefix-assignment technique for symmetry reduction ⋮ Two bilinear \((3\times3)\)-matrix multiplication algorithms of complexity 25 ⋮ Some elementary proofs of lower bounds in complexity theory ⋮ On the optimal evaluation of a set of bilinear forms ⋮ Global properties of tensor rank ⋮ The border rank of the multiplication of $2\times 2$ matrices is seven ⋮ The border support rank of two-by-two matrix multiplication is seven ⋮ Computing images of polynomial maps ⋮ On multiplication of 2 \(\times\) 2 matrices ⋮ The Waring Rank of the 3 x 3 Permanent ⋮ On the direct sum conjecture ⋮ Improved lower bounds for some matrix multiplication problems ⋮ A bilinear algorithm of length \(22\) for approximate multiplication of \(2\times 7\) and \(7\times 2\) matrices ⋮ Allowable processing orders in the accelerated cascade algorithm

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