On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination (Q1185458): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: The complexity of elementary algebra and geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Euclid's Algorithm and the Theory of Subresultants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subresultants and Reduced Polynomial Remainder Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Parallel Matrix Inversion Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5807665 / rank
 
Normal rank

Revision as of 16:23, 15 May 2024

scientific article
Language Label Description Also known as
English
On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination
scientific article

    Statements

    On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination (English)
    0 references
    0 references
    28 June 1992
    0 references
    complexity analysis
    0 references
    decision method
    0 references
    quantifier elimination
    0 references
    first order theory of the reals
    0 references
    parallel computation
    0 references
    bit model of computation
    0 references
    real number model of computation
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references