The bilinear complexity and practical algorithms for matrix multiplication (Q2940335)
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 6391014
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The bilinear complexity and practical algorithms for matrix multiplication |
scientific article; zbMATH DE number 6391014 |
Statements
The bilinear complexity and practical algorithms for matrix multiplication (English)
0 references
26 January 2015
0 references
bilinear complexity
0 references
matrix multiplication
0 references
boundary rank
0 references
least square method
0 references
bilinear algorithms
0 references
asymptotic arithmetic complexity
0 references
0 references
0 references
0.8939914703369141
0 references
0.8939914703369141
0 references
0.8702820539474487
0 references
0.8642557263374329
0 references
