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.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
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
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0747-7171(10)80005-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2001255903 / rank
 
Normal rank

Latest revision as of 09:08, 30 July 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
    0 references