Computational complexity. On the geometry of polynomials and a theory of cost. I (Q3740132)
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: Computational complexity. On the geometry of polynomials and a theory of cost. I |
scientific article; zbMATH DE number 3974176
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computational complexity. On the geometry of polynomials and a theory of cost. I |
scientific article; zbMATH DE number 3974176 |
Statements
Computational complexity. On the geometry of polynomials and a theory of cost. I (English)
0 references
1985
0 references
Euler method
0 references
polynomial root finding
0 references
complex polynomial
0 references
number of iterations
0 references
0.8704544305801392
0 references
0.8106314539909363
0 references
0.799644947052002
0 references
