Pages that link to "Item:Q4114690"
From MaRDI portal
The following pages link to On the Number of Multiplications Required for Matrix Multiplication (Q4114690):
Displaying 14 items.
- On the arithmetic complexity of matrix Kronecker powers (Q594594) (← links)
- The Mailman algorithm: a note on matrix-vector multiplication (Q976066) (← links)
- Extending the four Russians' bound to general matrix multiplication (Q1145999) (← links)
- On the asymptotic complexity of rectangular matrix multiplication (Q1173402) (← links)
- A lower bound for the multiplication of polynomials modulo a polynomial (Q1197994) (← links)
- More factors than subjects, tests and treatments: An indeterminacy theorem for canonical decomposition and individual differences scaling (Q1231461) (← links)
- Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics (Q1240771) (← links)
- Some elementary proofs of lower bounds in complexity theory (Q1245277) (← links)
- On the optimal evaluation of a set of bilinear forms (Q1245572) (← links)
- Fast rectangular matrix multiplication and applications (Q1271174) (← links)
- An improved combinatorial algorithm for Boolean matrix multiplication (Q1640996) (← links)
- On the inequivalence of bilinear algorithms for \(3\times 3\) matrix multiplication (Q2444860) (← links)
- A noncommutative algorithm for multiplying 3×3 matrices using 23 multiplications (Q4085178) (← links)
- Fast matrix multiplication and its algebraic neighbourhood (Q4610195) (← links)