Pages that link to "Item:Q2277024"
From MaRDI portal
The following pages link to Complexity of deciding the first-order theory of real closed fields (Q2277024):
Displaying 5 items.
- 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 (Q1185456) (← links)
- On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination (Q1185458) (← links)
- Quasi-decidability of a fragment of the first-order theory of real numbers (Q2013319) (← links)
- On the decidability of the real field with a generic power function (Q3107362) (← links)
- The complexity of definability by open first-order formulas (Q3386916) (← links)