Complexity measures for matrix multiplication algorithms (Q1152202): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf02575864 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1993258999 / rank | |||
Normal rank | |||
Latest revision as of 10:34, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity measures for matrix multiplication algorithms |
scientific article |
Statements
Complexity measures for matrix multiplication algorithms (English)
0 references
1980
0 references
computational complexity
0 references
computation of bilinear forms
0 references
EC-algorithms
0 references
APA-algorithms
0 references
ECD-algorithms
0 references
matrix multiplication
0 references
fixed precision
0 references
asymptotical complexity measures
0 references
stability
0 references
