An optimal algorithm for matrix multiplication
From MaRDI portal
Recommendations
Cited in
(24)- scientific article; zbMATH DE number 1419996 (Why is no real title available?)
- scientific article; zbMATH DE number 4072257 (Why is no real title available?)
- Improved algorithm of matrix multiplication based on memory
- On the Reuse of Additions in Matrix Multiplication
- Matrix-vector multiplication in sub-quadratic time (some preprocessing required)
- On the complexity of some algorithms of matrix multiplication
- Strassen's matrix multiplication algorithm for matrices of arbitrary order
- Two new algorithms for matrix multiplication and vector convolution
- Synthesis of an Optimal Family of Matrix Multiplication Algorithms on Linear Arrays
- scientific article; zbMATH DE number 823632 (Why is no real title available?)
- scientific article; zbMATH DE number 1464691 (Why is no real title available?)
- A new algorithm for Boolean matrix multiplication
- scientific article; zbMATH DE number 4149457 (Why is no real title available?)
- Algorithm 898
- On transformations of algorithms to multiply 2\(\times 2\) matrices
- An algorithm for multiplication of concatenated matrices
- On obtaining upper bounds on the complexity of matrix multiplication
- scientific article; zbMATH DE number 3856292 (Why is no real title available?)
- The matrix capacity of a tensor
- Optimization techniques for small matrix multiplication
- A noncommutative algorithm for multiplying 5\(\times 5\) matrices using 102 multiplications
- Optimization techniques for small matrix multiplication
- A practical algorithm for faster matrix multiplication
- scientific article; zbMATH DE number 151736 (Why is no real title available?)
This page was built for publication: An optimal algorithm for matrix multiplication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q911703)
