The border rank of the multiplication of $2\times 2$ matrices is seven
From MaRDI portal
Publication:3376942
DOI10.1090/S0894-0347-05-00506-0zbMath1088.68069MaRDI QIDQ3376942
Publication date: 27 March 2006
Published in: Journal of the American Mathematical Society (Search for Journal in Brave)
Related Items
Tensors in computations ⋮ Secant varieties of toric varieties ⋮ An introduction to the computational complexity of matrix multiplication ⋮ Algebraic geometry and representation theory in the study of matrix multiplication complexity and other problems in theoretical computer science ⋮ On the Geometry of Border Rank Decompositions for Matrix Multiplication and Other Tensors with Symmetry ⋮ Effective Criteria for Specific Identifiability of Tensors and Forms ⋮ Geometry and the complexity of matrix multiplication ⋮ Tensor surgery and tensor rank ⋮ Bad and good news for Strassen's laser method: border rank of \(\mathrm{Perm}_3\) and strict submultiplicativity ⋮ Numerical stability and tensor nuclear norm ⋮ New lower bounds for matrix multiplication and ⋮ Tensor rank is not multiplicative under the tensor product ⋮ Bounded-rank tensors are defined in bounded degree ⋮ Ideals of bounded rank symmetric tensors are generated in bounded degree ⋮ Equations for Lower Bounds on Border Rank ⋮ Ranks derived from multilinear maps ⋮ Induction for secant varieties of Segre varieties ⋮ Veldkamp-space aspects of a sequence of nested binary Segre varieties ⋮ Computing images of polynomial maps ⋮ On the Geometry of Border Rank Algorithms for n × 2 by 2 × 2 Matrix Multiplication ⋮ ON DIFFERENCES BETWEEN THE BORDER RANK AND THE SMOOTHABLE RANK OF A POLYNOMIAL ⋮ Unifying known lower bounds via geometric complexity theory
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on border rank
- Matrix multiplication via arithmetic progressions
- Rank and optimal computation of generic tensors
- Typical tensorial rank
- Border rank of m\(\times n\times (mn-q)\) tensors
- Tensor and border rank of certain classes of matrices and the fast evaluation of determinant, inverse matrix, and eigenvalues
- Lectures on the complexity of bilinear problems
- A lower bound for the border rank of a bilinear map
- On the order of approximation in approximative triadic decompositions of tensors
- Automata, languages and programming. Seventh Colloquium, Noordwijkerhout, the Netherlands, July 14-18, 1980
- \(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication
- Construction and classification of complex simple Lie algebras via projective geometry
- Gaussian elimination is not optimal
- On multiplication of 2 \(\times\) 2 matrices
- Approximate Solutions for the Bilinear Form Computational Problem
- Degeneration and complexity of bilinear maps: Some asymptotic spectra.
- Tensor Rank and Border Rank of Band Toeplitz Matrices
- On Minimizing the Number of Multiplications Necessary for Matrix Multiplication
