On Obtaining Upper Bounds on the Complexity of Matrix Multiplication
From MaRDI portal
Publication:4999420
DOI10.1007/978-1-4684-2001-2_4zbMath1467.68063OpenAlexW1536485115MaRDI QIDQ4999420
Publication date: 6 July 2021
Published in: Complexity of Computer Computations (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4684-2001-2_4
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)
Related Items
New combinations of methods for the acceleration of matrix multiplication, Fast matrix multiplication and its algebraic neighbourhood, Optimum computation of p bilinear forms, Strassen's \(2 \times 2\) matrix multiplication algorithm: a conceptual perspective, A noncommutative algorithm for multiplying 5 X 5 matrices using 103 multiplications, On the optimal computation of a set of symmetric and persymmetric bilinear forms, Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey
