Barriers for fast matrix multiplication from irreversibility
From MaRDI portal
Publication:5158496
DOI10.4086/TOC.2021.V017A002OpenAlexW3199350616MaRDI QIDQ5158496FDOQ5158496
Authors: Matthias Christandl, Péter Vrana, Jeroen Zuiddam 
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.06952
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Theory of computing (68Qxx)
Cites Work
- Powers of tensors and fast matrix multiplication
- Quantum entanglement
- Gaussian elimination is not optimal
- Relative bilinear complexity and matrix multiplication.
- Multiplying matrices faster than coppersmith-winograd
- Matrix multiplication via arithmetic progressions
- On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
- On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
- Asymptotic entanglement transformation between W and GHZ states
- On large subsets of \(\mathbb{F}_q^n\) with no three-term arithmetic progression
- Degeneration and complexity of bilinear maps: Some asymptotic spectra.
- The asymptotic spectrum of tensors.
- Asymptotic tensor rank of graph tensors: beyond matrix multiplication
- Title not available (Why is that?)
- On cap sets and the group-theoretic approach to matrix multiplication
- Universal points in the asymptotic spectrum of tensors
- Abelian tensors
- Fast Matrix Multiplication
- Title not available (Why is that?)
Cited In (4)
- Rank and border rank of Kronecker powers of tensors and Strassen's laser method
- A refined laser method and faster matrix multiplication
- Bounds on complexity of matrix multiplication away from Coppersmith-Winograd tensors
- Algebraic geometry and representation theory in the study of matrix multiplication complexity and other problems in theoretical computer science
This page was built for publication: Barriers for fast matrix multiplication from irreversibility
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5158496)
