<i>Computational Complexity</i>: On the Geometry of Polynomials and a Theory of Cost: II (Q3028211)
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: II |
scientific article; zbMATH DE number 4016046
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | <i>Computational Complexity</i>: On the Geometry of Polynomials and a Theory of Cost: II |
scientific article; zbMATH DE number 4016046 |
Statements
<i>Computational Complexity</i>: On the Geometry of Polynomials and a Theory of Cost: II (English)
0 references
1986
0 references
computational complexity
0 references
Euler method
0 references
polynomial root finding
0 references
number of iterations
0 references
zero of a complex polynomial
0 references
generalized Euler with modification
0 references
efficiency
0 references
0.8704544305801392
0 references
0.8046407699584961
0 references
0.8030700087547302
0 references
0.7988971471786499
0 references
