The trade-off between the additive complexity and the asynchronicity of linear and bilinear algorithms (Q1069699)
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 trade-off between the additive complexity and the asynchronicity of linear and bilinear algorithms |
scientific article; zbMATH DE number 3936516
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The trade-off between the additive complexity and the asynchronicity of linear and bilinear algorithms |
scientific article; zbMATH DE number 3936516 |
Statements
The trade-off between the additive complexity and the asynchronicity of linear and bilinear algorithms (English)
0 references
1986
0 references
bilinear algorithms
0 references
additive complexity
0 references
asynchronous algorithms
0 references
linear forms
0 references
bilinear forms
0 references
