On the additive complexity of 2 \(\times 2\) matrix multiplication
From MaRDI portal
Publication:672835
DOI10.1016/0020-0190(95)00176-XzbMath0875.68465OpenAlexW1998927407MaRDI QIDQ672835
Publication date: 28 February 1997
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(95)00176-x
Parallel algorithms in computer science (68W10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (3)
Some fast algorithms multiplying a matrix by its adjoint ⋮ Towards Practical Fast Matrix Multiplication based on Trilinear Aggregation ⋮ Fast matrix multiplication and its algebraic neighbourhood
Cites Work
- On the direct sum conjecture
- On varieties of optimal algorithms for the computation of bilinear mappings. I. The isotropy group of a bilinear mapping
- On varieties of optimal algorithms for the computation of bilinear mappings. II. Optimal algorithms for \(2\times 2\)-matrix multiplication
- Gaussian elimination is not optimal
- On multiplication of 2 \(\times\) 2 matrices
- Addition requirements for matrix and transposed matrix products
- Duality Applied to the Complexity of Matrix Multiplication and Other Bilinear Forms
- On the Additive Complexity of Matrix Multiplication
This page was built for publication: On the additive complexity of 2 \(\times 2\) matrix multiplication
