scientific article; zbMATH DE number 4150340
From MaRDI portal
Publication:3480175
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
Cited in
(11)- Dynamic evaluation and real closure.
- Quasi-decidability of a fragment of the first-order theory of real numbers
- Complexity of deciding Tarski algebra
- Decidability of univariate real algebra with predicates for rational and integer powers
- scientific article; zbMATH DE number 4154415 (Why is no real title available?)
- scientific article; zbMATH DE number 4014674 (Why is no real title available?)
- 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
- The complexity of definability by open first-order formulas
- On the decidability of the real field with a generic power function
- Real addition and the polynomial hierarchy
- 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)