The border support rank of two-by-two matrix multiplication is seven
From MaRDI portal
Publication:4615808
DOI10.4086/cjtcs.2018.005zbMath1473.15029arXiv1705.09652OpenAlexW2617690415MaRDI QIDQ4615808
Markus Bläser, Jeroen Zuiddam, Matthias Christandl
Publication date: 29 January 2019
Published in: Chicago Journal of Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1705.09652
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Multilinear algebra, tensor calculus (15A69)
Uses Software
Cites Work
- On varieties of optimal algorithms for the computation of bilinear mappings. II. Optimal algorithms for \(2\times 2\)-matrix multiplication
- Secant varieties of Segre-Veronese varieties
- Gaussian elimination is not optimal
- On multiplication of 2 \(\times\) 2 matrices
- Tensor rank is NP-complete
- Nondeterministic Quantum Query and Communication Complexities
- Lie Groups, Lie Algebras, and Representations
- On Minimizing the Number of Multiplications Necessary for Matrix Multiplication
- Fast matrix multiplication using coherent configurations
This page was built for publication: The border support rank of two-by-two matrix multiplication is seven