On the asymptotic complexity of rectangular matrix multiplication
type: Item
instance of: scholarly article
title: On the asymptotic complexity of rectangular matrix multiplication
zbMATH Open document ID: 0503.68029
DOI: 10.1016/0304-3975(83)90054-3
author: Grazia Lotti
author: Francesco Romani
published in: Theoretical Computer Science
publication date: 1983-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 15A63
zbMATH DE Number: 3793405
zbMATH Keywords: number of operations
MaRDI profile type: Publication
full work available at URL: 0304-3975(83)90054-3
OpenAlex ID: W1996176003
cites work: \(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication
cites work: Relations between exact and approximate bilinear algorithms. Applications
cites work: Approximate Solutions for the Bilinear Form Computational Problem
cites work: On the Number of Multiplications Required for Matrix Multiplication
cites work: Rapid Multiplication of Rectangular Matrices
cites work: New Fast Algorithms for Matrix Operations
cites work: New combinations of methods for the acceleration of matrix multiplication
cites work: Some Properties of Disjoint Sums of Tensors Related to Matrix Multiplication
cites work: Partial and Total Matrix Multiplication
cites work: Gaussian elimination is not optimal
description: scientific article; zbMATH DE number 3793405