New lower bounds for the border rank of matrix multiplication (Q2941634): Difference between revisions
From MaRDI portal
Changed label, description and/or aliases in en, and other parts |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: 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\) / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The rank of \(n \times n\) matrix multiplication is at least \(3n^2 - 2\sqrt{2}n^{\frac{3}{2}} - 3n\) / rank | |||
Normal rank | |||
Revision as of 16:59, 10 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | New lower bounds for the border rank of matrix multiplication |
scientific article |
Statements
21 August 2015
0 references
matrix multiplication complexity
0 references
border rank
0 references
cs.CC
0 references
math.AG
0 references
