Computational complexity of computing polynomials over the fields of real and complex numbers (Q5402553): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 01:40, 9 February 2024
scientific article; zbMATH DE number 6270114
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computational complexity of computing polynomials over the fields of real and complex numbers |
scientific article; zbMATH DE number 6270114 |
Statements
Computational complexity of computing polynomials over the fields of real and complex numbers (English)
0 references
14 March 2014
0 references
complexity of computation
0 references
evaluation
0 references
lower bounds of complexity
0 references
number of arithmetic operations
0 references
optimal schemes of computation
0 references
polynomial
0 references
preconditioning
0 references
scheme of computation
0 references
upper bounds of complexity
0 references
