scientific article; zbMATH DE number 7413496
From MaRDI portal
Publication:5158495
DOI10.4086/toc.2021.v017a001OpenAlexW3197358585MaRDI QIDQ5158495
Publication date: 25 October 2021
Published in: Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1812.08731
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (3)
Algebraic geometry and representation theory in the study of matrix multiplication complexity and other problems in theoretical computer science ⋮ Rank and border rank of Kronecker powers of tensors and Strassen's laser method ⋮ Barriers for fast matrix multiplication from irreversibility
Cites Work
- Unnamed Item
- On sunflowers and matrix multiplication
- Progression-free sets in \(\mathbb{Z}_4^n\) are exponentially small
- On large subsets of \(\mathbb{F}_q^n\) with no three-term arithmetic progression
- 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
- Degeneration and complexity of bilinear maps: Some asymptotic spectra.
- Solving Linear Programs in the Current Matrix Multiplication Time
- Universal points in the asymptotic spectrum of tensors
- Multiplying matrices faster than coppersmith-winograd
This page was built for publication:
