On the Complexity of Numerical Analysis (Q3642872)

From MaRDI portal
Revision as of 09:53, 17 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 Numerical Analysis
scientific article

    Statements

    On the Complexity of Numerical Analysis (English)
    0 references
    0 references
    0 references
    0 references
    6 November 2009
    0 references
    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