On the arithmetic complexity of Strassen-like matrix multiplications
From MaRDI portal
Publication:346560
Recommendations
- Matrix multiplication, a little faster
- On bilinear complexity of multiplication of \(m\times 2\) and \(2\times 2\) matrices
- A Strassen-like matrix multiplication suited for squaring and higher power computation
- Strassen's matrix multiplication algorithm for matrices of arbitrary order
- The aggregation and cancellation techniques as a practical tool for faster matrix multiplication
Cites work
- scientific article; zbMATH DE number 2151219 (Why is no real title available?)
- A Strassen-like matrix multiplication suited for squaring and higher power computation
- Algebraic Cryptanalysis
- Algorithm 898
- Algorithmic Cryptanalysis
- Block Recombination Approach for Subquadratic Space Complexity Binary Field Multiplication Based on Toeplitz Matrix-Vector Product
- Extra High Speed Matrix Multiplication on the Cray-2
- FFPACK
- GEMMW: A portable level 3 BLAS Winograd variant of Strassen's matrix- matrix multiply algorithm
- Gaussian elimination is not optimal
- How to multiply matrices faster
- Introduction to algorithms.
- Matrix multiplication via arithmetic progressions
- Memory efficient scheduling of Strassen-Winograd's matrix multiplication algorithm
- Multiplying matrices faster than coppersmith-winograd
- New Fast Algorithms for Matrix Operations
- On multiplication of 2 2 matrices
- On the Additive Complexity of Matrix Multiplication
- On the implementation of Strassen's fast multiplication algorithm
- Partial and Total Matrix Multiplication
- The aggregation and cancellation techniques as a practical tool for faster matrix multiplication
- \(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication
Cited in
(9)- Fast matrix multiplication and its algebraic neighbourhood
- A Strassen-like matrix multiplication suited for squaring and higher power computation
- Strassen's matrix multiplication algorithm for matrices of arbitrary order
- Symmetric matrices whose entries are linear functions
- On tangent lines to affine hypersurfaces
- Towards Practical Fast Matrix Multiplication based on Trilinear Aggregation
- scientific article; zbMATH DE number 4024638 (Why is no real title available?)
- Pebbling Game and Alternative Basis for High Performance Matrix Multiplication
- On probabilistic algorithm for solving almost all instances of the set partition problem
This page was built for publication: On the arithmetic complexity of Strassen-like matrix multiplications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q346560)
