A note on border rank

DOI10.1016/0020-0190(84)90023-1zbMATH Open0539.68029OpenAlexW1997237738MaRDI QIDQ794161FDOQ794161

Authors: Thomas Lickteig 

Publication date: 1984

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(84)90023-1

Recommendations

• A \(2\mathbf{n}^2-\log_2(\mathbf{n})-1\) lower bound for the border rank of matrix multiplication
• New lower bounds for the border rank of matrix multiplication
• A lower bound for the border rank of a bilinear map
• On the Geometry of Border Rank Algorithms for n × 2 by 2 × 2 Matrix Multiplication
• Equations for lower bounds on border rank

zbMATH Keywords

tensor rankborder rankcomplexity of matrix multiplicationcomputational complexity of bilinear forms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)

Cites Work

• Partial and Total Matrix Multiplication
• On the Asymptotic Complexity of Matrix Multiplication
• \(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication
• Rank and optimal computation of generic tensors
• Title not available (Why is that?)
• Title not available (Why is that?)
• Further Pathologies in Algebraic Geometry

Cited In (20)

• Geometry and the complexity of matrix multiplication
• A lower bound for the border rank of a bilinear map
• Tensor rank: matching polynomials and Schur rings
• On the order of approximation in approximative triadic decompositions of tensors
• Bad and good news for Strassen's laser method: border rank of \(\mathrm{Perm}_3\) and strict submultiplicativity
• On the geometry of border rank decompositions for matrix multiplication and other tensors with symmetry
• A \(2\mathbf{n}^2-\log_2(\mathbf{n})-1\) lower bound for the border rank of matrix multiplication
• Nontriviality of equations and explicit tensors in \(\mathbb{C}^m \otimes \mathbb{C}^m \otimes \mathbb{C}^m\) of border rank at least \(2m - 2\)
• On the Geometry of Border Rank Algorithms for n × 2 by 2 × 2 Matrix Multiplication
• A refined laser method and faster matrix multiplication
• An introduction to the computational complexity of matrix multiplication
• The border rank of the multiplication of $2\times 2$ matrices is seven
• New lower bounds for the border rank of matrix multiplication
• On degeneration of tensors and algebras
• Algebraic geometry and representation theory in the study of matrix multiplication complexity and other problems in theoretical computer science
• Typical tensorial rank
• Equations for lower bounds on border rank
• On commutativity and approximation
• The tensor Rank of \(5 \times 5\) matrices multiplication is bounded by 98 andits border Rank by 89
• New lower bounds for matrix multiplication and

This page was built for publication: A note on border rank

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q794161)