The following pages link to (Q3483266):
Displaying 8 items.
- Precise sequential and parallel complexity bounds for quantifier elimination over algebraically closed fields (Q752692) (← links)
- Some lower bounds for the complexity of the linear programming feasibility problem over the reals (Q998976) (← links)
- Effective Łojasiewicz inequalities in semialgebraic geometry (Q1177863) (← links)
- 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. II: The general decision problem. Preliminaries for quantifier elimination (Q1185457) (← links)
- Quantifier elimination for elementary geometry and elementary affine geometry (Q3144868) (← links)
- Sur la complexité du principe de Tarski-Seidenberg (Q4713865) (← links)
- Geometric Quantifier Elimination Heuristics for Automatically Generating Octagonal and Max-plus Invariants (Q4913868) (← links)
