New lower bounds for matrix multiplication and

DOI10.1017/fmp.2023.14zbMath1518.68137OpenAlexW4378714595MaRDI QIDQ6161101

Unnamed Author, Joseph M. Landsberg, Austin Conner

Publication date: 2 June 2023

Published in: Forum of Mathematics, Pi (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/fmp.2023.14

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Multilinear algebra, tensor calculus (15A69) Secant varieties, tensor rank, varieties of sums of powers (14N07)

Related Items (1)

An improved upper bound for the Waring rank of the determinant

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the nuclear norm and the singular value decomposition of tensors
• Equations for secant varieties of Veronese and other varieties
• Vector bundles give equations of cactus varieties
• A note on border rank
• Koszul-Young flattenings and symmetric border rank of the determinant
• Rank and optimal computation of generic tensors
• Relations between exact and approximate bilinear algorithms. Applications
• Varieties of apolar subschemes of toric surfaces
• Power sums, Gorenstein algebras, and determinantal loci. With an appendix `The Gotzmann theorems and the Hilbert scheme' by Anthony Iarrobino and Steven L. Kleiman
• Apolarity, border rank, and multigraded Hilbert scheme
• Rank and border rank of Kronecker powers of tensors and Strassen's laser method
• A bound for the Waring rank of the determinant via syzygies
• Abelian tensors
• Gaussian elimination is not optimal
• The bilinear complexity and practical algorithms for matrix multiplication
• Fast Matrix Multiplication
• New lower bounds for the border rank of matrix multiplication
• The border rank of the multiplication of $2\times 2$ matrices is seven
• Deformation Theory
• Relative bilinear complexity and matrix multiplication.
• Approximate Solutions for the Bilinear Form Computational Problem
• Multigraded Hilbert schemes
• Barriers for Rank Methods in Arithmetic Complexity
• Further Limitations of the Known Approaches for Matrix Multiplication
• Limits on All Known (and Some Unknown) Approaches to Matrix Multiplication
• Limits on the Universal method for matrix multiplication
• Tensors: Asymptotic Geometry and Developments 2016–2018
• Computational Complexity
• On the Geometry of Border Rank Decompositions for Matrix Multiplication and Other Tensors with Symmetry
• Geometry and Complexity Theory
• Lie groups beyond an introduction
• Multigraded apolarity

This page was built for publication: New lower bounds for matrix multiplication and