On the arithmetic complexity of Strassen-like matrix multiplications

DOI10.1016/j.jsc.2016.07.004zbMath1353.68309OpenAlexW2473648675WikidataQ114154472 ScholiaQ114154472MaRDI QIDQ346560

Murat Cenk, M. Anwarul 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

zbMATH Keywords

computational complexitycomputer algebracryptographic computationsfast matrix multiplicationStrassen-like matrix multiplication

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Related Items (6)

On probabilistic algorithm for solving almost all instances of the set partition problem ⋮ Towards Practical Fast Matrix Multiplication based on Trilinear Aggregation ⋮ Pebbling Game and Alternative Basis for High Performance Matrix Multiplication ⋮ Symmetric matrices whose entries are linear functions ⋮ Fast matrix multiplication and its algebraic neighbourhood ⋮ On tangent lines to affine hypersurfaces

Uses Software

• FFLAS-FFPACK
• M4RI
• Algorithm 898

Cites Work

• Unnamed Item
• Unnamed Item
• The aggregation and cancellation techniques as a practical tool for faster matrix multiplication
• How to multiply matrices faster
• Matrix multiplication via arithmetic progressions
• On the implementation of Strassen's fast multiplication algorithm
• \(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication
• GEMMW: A portable level 3 BLAS Winograd variant of Strassen's matrix- matrix multiply algorithm
• Gaussian elimination is not optimal
• On multiplication of 2 \(\times\) 2 matrices
• Memory efficient scheduling of Strassen-Winograd's matrix multiplication algorithm
• A Strassen-like matrix multiplication suited for squaring and higher power computation
• Algorithm 898
• Algebraic Cryptanalysis
• Extra High Speed Matrix Multiplication on the Cray-2
• New Fast Algorithms for Matrix Operations
• Partial and Total Matrix Multiplication
• On the Additive Complexity of Matrix Multiplication
• FFPACK
• Algorithmic Cryptanalysis
• Block Recombination Approach for Subquadratic Space Complexity Binary Field Multiplication Based on Toeplitz Matrix-Vector Product
• Multiplying matrices faster than coppersmith-winograd

This page was built for publication: On the arithmetic complexity of Strassen-like matrix multiplications