A \(2\mathbf{n}^2-\log_2(\mathbf{n})-1\) lower bound for the border rank of matrix multiplication (Q4619419)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A 2n^2-_2(n)-1 lower bound for the border rank of matrix multiplication |
scientific article; zbMATH DE number 7013511
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A \(2\mathbf{n}^2-\log_2(\mathbf{n})-1\) lower bound for the border rank of matrix multiplication |
scientific article; zbMATH DE number 7013511 |
Statements
A $2{\mathbf{n}}^2-{\text{log}}_2({\mathbf{n}})-1$ lower bound for the border rank of matrix multiplication (English)
0 references
6 February 2019
0 references
matrix multiplication complexity
0 references
border rank
0 references
0.8773190379142761
0 references
0.8628249168395996
0 references
0.8600203990936279
0 references
0.8254326581954956
0 references
