On the cost of computing roots of polynomials (Q3330394): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Q1215253 / rank
Normal rank
 
Property / author
 
Property / author: Ze-Ke Wang / rank
Normal rank
 
Property / author
 
Property / author: Sen-Lin Xu / rank
Normal rank
 
Property / author
 
Property / author: Harold W. Kuhn / rank
 
Normal rank
Property / author
 
Property / author: Ze-Ke Wang / rank
 
Normal rank
Property / author
 
Property / author: Sen-Lin Xu / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A PL homotopy for finding all the roots of a polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4138976 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The fundamental theorem of algebra and complexity theory / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf02612355 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2040238541 / rank
 
Normal rank

Latest revision as of 09:39, 30 July 2024

scientific article
Language Label Description Also known as
English
On the cost of computing roots of polynomials
scientific article

    Statements

    On the cost of computing roots of polynomials (English)
    0 references
    1984
    0 references
    roots of polynomials
    0 references
    complementary pivoting
    0 references
    piecewise linear homotopy
    0 references
    computational complexity
    0 references
    zeros of a polynomial
    0 references
    0 references
    0 references
    0 references

    Identifiers