On Minimizing the Number of Multiplications Necessary for Matrix Multiplication

Cited in

(58)

Improved lower bounds for some matrix multiplication problems
Allowable processing orders in the accelerated cascade algorithm
Gaussian elimination is optimal for solving linear equations in dimension two
Complexities of special matrix multiplication problems
On varieties of optimal algorithms for the computation of bilinear mappings. I. The isotropy group of a bilinear mapping
On the algorithmic complexity of associative algebras
Dual problems of multiplication of a vector by a matrix
Fast modular transforms
Complexity of monotone networks for Boolean matrix product
A survey of techniques in applied computational complexity
Untersuchungen des Zeitgewinns durch neue Algorithmen zur Matrix- Multiplikation
Commutativity, non-commutativity, and bilinearity
Some elementary proofs of lower bounds in complexity theory
On the optimal evaluation of a set of bilinear forms
Global properties of tensor rank
On the complexity of the multiplication of matrices of small formats
The tensor rank of tensor product of two three-qubit W states is eight
Tensor rank is not multiplicative under the tensor product
Two bilinear \((3\times3)\)-matrix multiplication algorithms of complexity 25
Fast commutative matrix algorithms
An introduction to the computational complexity of matrix multiplication
Improved method for finding optimal formulas for bilinear maps in a finite field
Computing images of polynomial maps
A bilinear algorithm of length \(22\) for approximate multiplication of \(2\times 7\) and \(7\times 2\) matrices
Tensor surgery and tensor rank
On the inequivalence of bilinear algorithms for \(3\times 3\) matrix multiplication
On multiplication of 2 2 matrices
The bilinear complexity and practical algorithms for matrix multiplication
The border rank of the multiplication of 2\times 2 matrices is seven
Geometry and the complexity of matrix multiplication
A noncommutative algorithm for multiplying 3×3 matrices using 23 multiplications
An extended duality theorem and multiplication of several matrices
A counterexample to Comon's conjecture
Fast matrix multiplication and its algebraic neighbourhood
The border support rank of two-by-two matrix multiplication is seven
On the exact and approximate bilinear complexities of multiplication of \(4\times 2\) and \(2\times 2\) matrices
On bilinear complexity of multiplication of \(m\times 2\) and \(2\times 2\) matrices
Optimization techniques for small matrix multiplication
The Waring rank of the 3 x 3 permanent
An adaptive prefix-assignment technique for symmetry reduction
Skew-polynomial-sparse matrix multiplication
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
More on Tensors with Different Rank and Symmetric Rank
A lower bound for bilinear complexity of matrix multiplication over a finite field
Notions of tensor rank
Finding complex-valued solutions of brent equations using nonlinear least squares
Semi-analytical solution of Brent equations
The tensor Rank of \(5 \times 5\) matrices multiplication is bounded by 98 andits border Rank by 89
Several remarks on tensor rank computation
Some new non-commutative matrix multiplication algorithms of size (n, m, 6)
Adaptive flip graph algorithm for matrix multiplication
Alternative basis matrix multiplication is fast and \(\mathrm{stable}^\dag\)
Faster search for tensor decomposition over finite fields
Flip graphs with symmetry and new matrix multiplication schemes
On the direct sum conjecture

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

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