The bit complexity of matrix multiplication and of related computations in linear algebra. The segmented \(\lambda\) algorithms (Q1121670)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The bit complexity of matrix multiplication and of related computations in linear algebra. The segmented algorithms |
scientific article; zbMATH DE number 4104381
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The bit complexity of matrix multiplication and of related computations in linear algebra. The segmented \(\lambda\) algorithms |
scientific article; zbMATH DE number 4104381 |
Statements
The bit complexity of matrix multiplication and of related computations in linear algebra. The segmented \(\lambda\) algorithms (English)
0 references
1985
0 references
bit complexity
0 references
matrix multiplication
0 references
\(\lambda \) algorithms
0 references
any precision approximation algorithms
0 references
0 references
0 references
0 references
0.9073321
0 references
0.9033139
0 references
0.89102215
0 references
0.88409907
0 references
0.8832265
0 references
0.8828835
0 references
0.8815813
0 references
0.8815153
0 references
