scientific article
From MaRDI portal
Publication:3816908
zbMath0665.65039MaRDI QIDQ3816908
Publication date: 1988
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
bibliographymatrix multiplicationStrassen's algorithmrelative complexitydirect sum methodsbilinear and trilinear algorithmslambda-algorithm
Related Items (8)
Upper bounds for determinants of symmetric positive-definite matrices ⋮ The bilinear complexity and practical algorithms for matrix multiplication ⋮ On the approximate bilinear complexity of matrix multiplication ⋮ 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 ⋮ Complexity of multiplication in commutative group algebras over fields of characteristic 0 ⋮ Two bilinear \((3\times3)\)-matrix multiplication algorithms of complexity 25 ⋮ A bilinear algorithm of length \(22\) for approximate multiplication of \(2\times 7\) and \(7\times 2\) matrices
This page was built for publication:
