Bounds on complexity of matrix multiplication away from Coppersmith-Winograd tensors
From MaRDI portal
Publication:2154275
DOI10.1016/j.jpaa.2022.107142OpenAlexW4280633903WikidataQ114155355 ScholiaQ114155355MaRDI QIDQ2154275
Tim Seynnaeve, Roser Homs, Joachim Jelisiejew, Mateusz Michałek
Publication date: 19 July 2022
Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2103.12598
Effectivity, complexity and computational aspects of algebraic geometry (14Q20) Multilinear algebra, tensor calculus (15A69) Exterior algebra, Grassmann algebras (15A75)
Related Items (1)
Cites Work
- Matrix multiplication via arithmetic progressions
- Hilbert schemes of 8 points
- Plethysm and fast matrix multiplication
- Apolarity, border rank, and multigraded Hilbert scheme
- Abelian tensors
- Fast Matrix Multiplication
- Powers of tensors and fast matrix multiplication
- Relative bilinear complexity and matrix multiplication.
- Partial and Total Matrix Multiplication
- Polynomials and the exponent of matrix multiplication
- On degeneration of tensors and algebras
- Further Limitations of the Known Approaches for Matrix Multiplication
- Barriers for fast matrix multiplication from irreversibility
- Geometry and Complexity Theory
- Multiplying matrices faster than coppersmith-winograd
- Unnamed Item
- Unnamed Item
This page was built for publication: Bounds on complexity of matrix multiplication away from Coppersmith-Winograd tensors
