On the Complexity of Numerical Analysis (Q3642872)

From MaRDI portal
Revision as of 21:36, 19 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
On the Complexity of Numerical Analysis
scientific article

    Statements

    title
    On the Complexity of Numerical Analysis (English)
    0 references
    author
    Peter Bürgisser
    0 references
    Peter Bro Miltersen
    0 references
    Eric W. Allender
    0 references
    publication date
    6 November 2009
    0 references
    zbMATH Keywords
    Blum-Shub-Smale model
    0 references
    arithmetic circuits
    0 references
    counting hierarchy
    0 references
    BPP
    0 references
    sum of square roots problem
    0 references
    straight-line programs
    0 references

    Identifiers

    DOI
    10.1137/070697926
    0 references
    zbMATH DE Number
    5626419
    0 references
    Wikidata QID
    Q56067400
    0 references
    OpenAlex ID
    W2040721698
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3642872&oldid=32002275"
    Powered by MediaWiki