On the Complexity of Polynomial Zeros (Q4018402)

From MaRDI portal
Revision as of 20:41, 23 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On the Complexity of Polynomial Zeros
scientific article

    Statements

    title
    On the Complexity of Polynomial Zeros (English)
    0 references
    author
    Dario Andrea Bini
    0 references
    Luca Gemignani
    0 references
    publication date
    16 January 1993
    0 references
    zbMATH Keywords
    polynomial zeros
    0 references
    parallel complexity
    0 references
    Euclidean scheme
    0 references
    polynomial root- finding
    0 references

    Identifiers

    DOI
    10.1137/0221047
    0 references
    Mathematics Subject Classification ID
    65H05
    0 references
    65Y05
    0 references
    65Y20
    0 references
    30C15
    0 references
    12Y05
    0 references
    zbMATH DE Number
    90185
    0 references
     
      Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4018402&oldid=8464269"
      Powered by MediaWiki