Limits on the Universal method for matrix multiplication
From MaRDI portal
Publication:5091763
DOI10.4230/LIPIcs.CCC.2019.12OpenAlexW2964549137MaRDI QIDQ5091763
Publication date: 27 July 2022
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2019/10834/pdf/LIPIcs-CCC-2019-12.pdf/
Related Items (6)
Bad and good news for Strassen's laser method: border rank of \(\mathrm{Perm}_3\) and strict submultiplicativity ⋮ New lower bounds for matrix multiplication and ⋮ Weighted slice rank and a minimax correspondence to Strassen's spectra ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The asymptotic induced matching number of hypergraphs: balanced binary strings
Cites Work
- Unnamed Item
- Matrix multiplication via arithmetic progressions
- Gaussian elimination is not optimal
- Improved bound for complexity of matrix multiplication
- Fast Matrix Multiplication
- Powers of tensors and fast matrix multiplication
- Relative bilinear complexity and matrix multiplication.
- Partial and Total Matrix Multiplication
- On the Asymptotic Complexity of Matrix Multiplication
- On cap sets and the group-theoretic approach to matrix multiplication
- The growth rate of tri-colored sum-free sets
- Degeneration and complexity of bilinear maps: Some asymptotic spectra.
- Further Limitations of the Known Approaches for Matrix Multiplication
- Solving linear programs in the current matrix multiplication time
- Universal points in the asymptotic spectrum of tensors
- Probabilistic Tensors and Opportunistic Boolean Matrix Multiplication
- Multiplying matrices faster than coppersmith-winograd
- Fast matrix multiplication using coherent configurations
This page was built for publication: Limits on the Universal method for matrix multiplication
