On the cost of approximating all roots of a complex polynomial (Q3698169): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Homotopies for computation of fixed points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homotopies for computation of fixed points on unbounded regions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3285751 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the cost of computing roots of polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5546070 / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>Computational Complexity</i>: On the Geometry of Polynomials and a Theory of Cost: II / rank
 
Normal rank
Property / cites work
 
Property / cites work: The fundamental theorem of algebra and complexity theory / rank
 
Normal rank

Latest revision as of 19:23, 14 June 2024

scientific article
Language Label Description Also known as
English
On the cost of approximating all roots of a complex polynomial
scientific article

    Statements

    On the cost of approximating all roots of a complex polynomial (English)
    0 references
    0 references
    0 references
    1985
    0 references
    0 references
    computational complexity
    0 references
    homotopy algorithm
    0 references
    complex polynomial
    0 references
    Newton's method
    0 references
    zeros of polynomials
    0 references