\(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication (Q1253097)
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 3614180
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | \(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication |
scientific article; zbMATH DE number 3614180 |
Statements
\(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication (English)
0 references
1979
0 references
Approximate Matrix Multiplication
0 references
Computational
0 references
Complexity
0 references
