On the complexity of the multiplication of matrices of small formats
type: Item
instance of: scholarly article
title: On the complexity of the multiplication of matrices of small formats
zbMATH Open document ID: 1026.68062
DOI: 10.1016/S0885-064X(02)00007-9
author: Markus Bläser
published in: Journal of Complexity
publication date: 2003-06-25T00:00:00Z
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 1934778
zbMATH Keywords: matrix multiplication
MaRDI profile type: Publication
cites work: On the algorithmic complexity of associative algebras
cites work: \(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication
cites work: Lower bounds for the multiplicative complexity of matrix multiplication
cites work: Lower bounds for the bilinear complexity of associative algebras
cites work: On the optimal evaluation of a set of bilinear forms
cites work: Q4331740
cites work: Matrix multiplication via arithmetic progressions
cites work: On varieties of optimal algorithms for the computation of bilinear mappings. II. Optimal algorithms for \(2\times 2\)-matrix multiplication
cites work: On varieties of optimal algorithms for the computation of bilinear mappings. I. The isotropy group of a bilinear mapping
cites work: Lectures on the complexity of bilinear problems
cites work: On Minimizing the Number of Multiplications Necessary for Matrix Multiplication
cites work: Noncommutative Bilinear Algorithms for $3 \times 3$ Matrix Multiplication
cites work: A noncommutative algorithm for multiplying 3×3 matrices using 23 multiplications
cites work: Partial and Total Matrix Multiplication
cites work: Gaussian elimination is not optimal
cites work: Relative bilinear complexity and matrix multiplication.
cites work: On Winograd's Algorithm for Inner Products
cites work: On multiplication of 2 \(\times\) 2 matrices
description: scientific article; zbMATH DE number 1934778