On the complexity of some algorithms of matrix multiplication

DOI10.1016/0196-6774(85)90019-7zbMath0577.68059OpenAlexW1974805505MaRDI QIDQ3698315

V. B. Alekseev

Publication date: 1985

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-6774(85)90019-7

zbMATH Keywords

multiplication of matrices over arbitrary fields

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)

Related Items (12)

An introduction to the computational complexity of matrix multiplication ⋮ The bilinear complexity and practical algorithms for matrix multiplication ⋮ Unnamed Item ⋮ Geometry and the complexity of matrix multiplication ⋮ The approximate bilinear complexity of the multiplication of matrices of sizes \(2\times n\) and \(n\times 4\) ⋮ On bilinear complexity of multiplying \(2 \times 2\)-matrix by \(2 \times m\)-matrix over finite field ⋮ On the inequivalence of bilinear algorithms for \(3\times 3\) matrix multiplication ⋮ On the exact and approximate bilinear complexities of multiplication of \(4\times 2\) and \(2\times 2\) matrices ⋮ An adaptive prefix-assignment technique for symmetry reduction ⋮ Two bilinear \((3\times3)\)-matrix multiplication algorithms of complexity 25 ⋮ Semisimple algebras of almost minimal rank over the reals ⋮ A bilinear algorithm of length \(22\) for approximate multiplication of \(2\times 7\) and \(7\times 2\) matrices

This page was built for publication: On the complexity of some algorithms of matrix multiplication