Computational complexity of computing polynomials over the fields of real and complex numbers (Q5402553)
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 6270114
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.7931017279624939
0 references
0.7770318984985352
0 references
0.7729424238204956
0 references
0.7664638161659241
0 references
