On the arithmetic complexity of Strassen-like matrix multiplications
From MaRDI portal
Publication:346560
DOI10.1016/J.JSC.2016.07.004zbMATH Open1353.68309OpenAlexW2473648675WikidataQ114154472 ScholiaQ114154472MaRDI QIDQ346560FDOQ346560
Authors: Murat Cenk, M. Anwar Hasan 
Publication date: 29 November 2016
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://hdl.handle.net/11511/31534
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
computational complexitycomputer algebracryptographic computationsfast matrix multiplicationStrassen-like matrix multiplication
Cites Work
- GEMMW: A portable level 3 BLAS Winograd variant of Strassen's matrix- matrix multiply algorithm
- Algorithm 898
- Introduction to algorithms.
- Gaussian elimination is not optimal
- Partial and Total Matrix Multiplication
- Multiplying matrices faster than coppersmith-winograd
- How to multiply matrices faster
- Matrix multiplication via arithmetic progressions
- On multiplication of 2 \(\times\) 2 matrices
- Algebraic Cryptanalysis
- \(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication
- On the implementation of Strassen's fast multiplication algorithm
- Memory efficient scheduling of Strassen-Winograd's matrix multiplication algorithm
- A Strassen-like matrix multiplication suited for squaring and higher power computation
- Extra High Speed Matrix Multiplication on the Cray-2
- New Fast Algorithms for Matrix Operations
- On the Additive Complexity of Matrix Multiplication
- FFPACK
- Title not available (Why is that?)
- Algorithmic Cryptanalysis
- Block Recombination Approach for Subquadratic Space Complexity Binary Field Multiplication Based on Toeplitz Matrix-Vector Product
- The aggregation and cancellation techniques as a practical tool for faster 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
- On tangent lines to affine hypersurfaces
- Symmetric matrices whose entries are linear functions
- Towards Practical Fast Matrix Multiplication based on Trilinear Aggregation
- Title not available (Why is that?)
- Pebbling Game and Alternative Basis for High Performance Matrix Multiplication
- On probabilistic algorithm for solving almost all instances of the set partition problem
Uses Software
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)
