scientific article; zbMATH DE number 4150340

zbMATH Open0702.12006MaRDI QIDQ3480175FDOQ3480175

Authors: Dima Grigoriev 

Publication date: 1988

Full work available at URL: https://eudml.org/doc/188444

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 4014674
• scientific article; zbMATH DE number 3895043
• On the computational complexity and geometry of the first-order theory of the reals. II: The general decision problem. Preliminaries for quantifier elimination
• On the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals
• On the combinatorial and algebraic complexity of quantifier elimination

zbMATH Keywords

complexitydecidability algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Decidability of theories and sets of sentences (03B25) Decidability and field theory (12L05) Ordered fields (12J15)

Cited In (10)

• Dynamic evaluation and real closure.
• Real addition and the polynomial hierarchy
• Title not available (Why is that?)
• On the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals
• Complexity of deciding Tarski algebra
• On the decidability of the real field with a generic power function
• Title not available (Why is that?)
• The complexity of definability by open first-order formulas
• Quasi-decidability of a fragment of the first-order theory of real numbers
• On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3480175)