Complexity of Computations with Matrices and Polynomials (Q4016917)
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 89508
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of Computations with Matrices and Polynomials |
scientific article; zbMATH DE number 89508 |
Statements
Complexity of Computations with Matrices and Polynomials (English)
0 references
16 January 1993
0 references
residue arithmetic
0 references
matrix computations
0 references
complexity estimates
0 references
fixed and variable precision computations
0 references
binary segmentations
0 references
compact multigrid algorithm
0 references
arithmetic complexity
0 references
polynomial computations
0 references
polynomial division
0 references
0.8280377388000488
0 references
0.77488112449646
0 references
0.7728428244590759
0 references
