The bit-operation complexity of approximate evaluation of matrix and polynomial products using modular arithmetic (Q1165575)
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-operation complexity of approximate evaluation of matrix and polynomial products using modular arithmetic |
scientific article; zbMATH DE number 3767038
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The bit-operation complexity of approximate evaluation of matrix and polynomial products using modular arithmetic |
scientific article; zbMATH DE number 3767038 |
Statements
The bit-operation complexity of approximate evaluation of matrix and polynomial products using modular arithmetic (English)
0 references
1982
0 references
matrix products
0 references
algorithms
0 references
numerical stability
0 references
0 references
0 references
