The bit complexity of matrix multiplication and of related computations in linear algebra. The segmented \(\lambda\) algorithms (Q1121670): Difference between revisions
From MaRDI portal
Latest revision as of 14:39, 19 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The bit complexity of matrix multiplication and of related computations in linear algebra. The segmented \(\lambda\) algorithms |
scientific article |
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
