On the approximate bilinear complexity of matrix multiplication (Q891131)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6509226
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the approximate bilinear complexity of matrix multiplication |
scientific article; zbMATH DE number 6509226 |
Statements
On the approximate bilinear complexity of matrix multiplication (English)
0 references
16 November 2015
0 references
bilinear algorithms
0 references
matrix tensors
0 references
approximate algorithms
0 references
matrix multiplication
0 references
bilinear complexity
0 references
0 references
0.9104337096214294
0 references
0.9059757590293884
0 references
0.8642557263374329
0 references
0.8597507476806641
0 references
