On the Computational Complexity of Approximating Solutions for Real Algebraic Formulae (Q4027865)

From MaRDI portal
Revision as of 00:12, 24 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 Computational Complexity of Approximating Solutions for Real Algebraic Formulae
scientific article

    Statements

    On the Computational Complexity of Approximating Solutions for Real Algebraic Formulae (English)
    0 references
    0 references
    0 references
    9 March 1993
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    decision methods
    0 references
    roots
    0 references
    computational complexity
    0 references
    systems of polynomial equations
    0 references
    inequalities
    0 references