On the additive complexity of 2 2 matrix multiplication

DOI10.1016/0020-0190(95)00176-XMaRDI QIDQ672835zbMATH OpenOpenAlexFDO

Authors Nader H. Bshouty

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

zbMATH Keywords

AlgorithmsComputational complexity

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Parallel algorithms in computer science (68W10)

Recommendations

• On bilinear complexity of multiplying \(2 \times 2\)-matrix by \(2 \times m\)-matrix over finite field
• On the complexity of some algorithms of matrix multiplication
• On the exact and approximate bilinear complexities of multiplication of \(4\times 2\) and \(2\times 2\) matrices
• On bilinear complexity of multiplication of \(m\times 2\) and \(2\times 2\) matrices
• A Lower Bound for Matrix Multiplication

Cites work

• Addition requirements for matrix and transposed matrix products
• Duality Applied to the Complexity of Matrix Multiplication and Other Bilinear Forms
• Gaussian elimination is not optimal
• On multiplication of 2 \(\times\) 2 matrices
• On the Additive Complexity of Matrix Multiplication
• 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

Cited in

(8)

• Towards Practical Fast Matrix Multiplication based on Trilinear Aggregation
• Multiplicative complexity of length-2^mtwo-dimensional discrete cosine transform
• On the fraction of matrices with maximal additive complexity
• The approximate bilinear complexity of the multiplication of matrices of sizes \(2\times n\) and \(n\times 4\)
• On the exact and approximate bilinear complexities of multiplication of \(4\times 2\) and \(2\times 2\) matrices
• Fast matrix multiplication and its algebraic neighbourhood
• Some fast algorithms multiplying a matrix by its adjoint
• On the complexity of some algorithms of matrix multiplication

This page was built for publication: On the additive complexity of 2 \(\times 2\) matrix multiplication

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q672835)