Improved lower bounds for some matrix multiplication problems

DOI10.1016/0020-0190(85)90016-XMaRDI QIDQ1068534zbMATH OpenFDO

Authors Jean Takche, Joseph Ja'Ja'

Publication date 1985

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(85)90016-X

zbMATH Keywords

arithmetic complexitymatrix multiplication

Mathematics Subject Classification ID

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

Cites work

• Gaussian elimination is not optimal
• scientific article; zbMATH DE number 3628385 (Why is no real title available?)
• On Minimizing the Number of Multiplications Necessary for Matrix Multiplication
• On the algorithmic complexity of associative algebras
• On the Asymptotic Complexity of Matrix Multiplication
• On the optimal evaluation of a set of bilinear forms
• Partial and Total Matrix Multiplication

This page was built for publication: Improved lower bounds for some matrix multiplication problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1068534)