Complexity measures for matrix multiplication algorithms (Q1152202): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: \(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Approximate Solutions for the Bilinear Form Computational Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Relations between exact and approximate bilinear algorithms. Applications / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Fast multiplication of large numbers / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Gaussian elimination is not optimal / rank | |||
Normal rank | |||
Revision as of 11:13, 13 June 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
