<i>Computational Complexity</i>: On the Geometry of Polynomials and a Theory of Cost: II (Q3028211)

From MaRDI portal
Revision as of 01:39, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
<i>Computational Complexity</i>: On the Geometry of Polynomials and a Theory of Cost: II
scientific article

    Statements

    <i>Computational Complexity</i>: On the Geometry of Polynomials and a Theory of Cost: II (English)
    0 references
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references