Improved lower bounds for some matrix multiplication problems
From MaRDI portal
Publication:1068534
DOI10.1016/0020-0190(85)90016-XzbMath0582.68013MaRDI QIDQ1068534
Publication date: 1985
Published in: Information Processing Letters (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
68W30: Symbolic computation and algebraic computation
Cites Work
- Unnamed Item
- On the algorithmic complexity of associative algebras
- On the optimal evaluation of a set of bilinear forms
- Gaussian elimination is not optimal
- Partial and Total Matrix Multiplication
- On the Asymptotic Complexity of Matrix Multiplication
- On Minimizing the Number of Multiplications Necessary for Matrix Multiplication