The rank of \(n \times n\) matrix multiplication is at least \(3n^2 - 2\sqrt{2}n^{\frac{3}{2}} - 3n\) (Q389730): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: New Lower Bounds for the Rank of Matrix Multiplication / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3096060 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: New lower bounds for the border rank of matrix multiplication / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Gaussian elimination is not optimal / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Rank and optimal computation of generic tensors / rank | |||
Normal rank | |||
Revision as of 05:54, 7 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The rank of \(n \times n\) matrix multiplication is at least \(3n^2 - 2\sqrt{2}n^{\frac{3}{2}} - 3n\) |
scientific article |
Statements
The rank of \(n \times n\) matrix multiplication is at least \(3n^2 - 2\sqrt{2}n^{\frac{3}{2}} - 3n\) (English)
0 references
21 January 2014
0 references
tensors
0 references
matrix multiplication
0 references
complexity theory
0 references
