Beyond the Alder-Strassen bound.
type: Item
instance of: scholarly article
title: Beyond the Alder-Strassen bound.
zbMATH Open document ID: 1083.68046
author: Markus Bläser
published in: Theoretical Computer Science
publication date: 2005-04-06T00:00:00Z
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 16Z05
Mathematics Subject Classification ID: 16W30
Mathematics Subject Classification ID: 16S50
Mathematics Subject Classification ID: 68W30
zbMATH DE Number: 2153214
zbMATH Keywords: associative algebras
zbMATH Keywords: lower bounds
zbMATH Keywords: multiplicative complexity
MaRDI profile type: Publication
full work available at URL: j.tcs.2004.09.029
OpenAlex ID: W2038253106
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: Q4535011
cites work: The complexity of bivariate power series arithmetic.
cites work: On the optimal evaluation of a set of bilinear forms
cites work: A Lower Bound for Matrix Multiplication
cites work: Q4331740
cites work: Matrix multiplication via arithmetic progressions
cites work: Q4300259
cites work: Characterization of Division Algebras of Minimal Rank and the Structure of their Algorithm Varieties
cites work: Lectures on the complexity of bilinear problems
cites work: Q3735893
cites work: Partial and Total Matrix Multiplication
cites work: Gaussian elimination is not optimal
cites work: Q4047029
cites work: Rank and optimal computation of generic tensors
cites work: Relative bilinear complexity and matrix multiplication.
DOI: 10.1016/J.TCS.2004.09.029
description: scientific article; zbMATH DE number 2153214