scientific article; zbMATH DE number 4154415
From MaRDI portal
Recommendations
- Sur la complexité du principe de Tarski-Seidenberg
- scientific article; zbMATH DE number 3895043
- On the computational complexity and geometry of the first-order theory of the reals. III: 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
- scientific article; zbMATH DE number 4150340
Cited in
(13)- Algorithms of intrinsic complexity for point searching in compact real singular hypersurfaces
- Sur la complexité du principe de Tarski-Seidenberg
- Polar varieties, real equation solving, and data structures: the hypersurface case
- Complexity of deciding Tarski algebra
- Finding connected components of a semialgebraic set in subexponential time
- Generalized polar varieties and an efficient real elimination.
- Generalized polar varieties: geometry and algorithms
- Effective Łojasiewicz inequalities in semialgebraic geometry
- Parallel time and quantifier prefixes
- Point searching in real singularcomplete intersection varieties: algorithms of intrinsic complexity
- scientific article; zbMATH DE number 7139948 (Why is no real title available?)
- Une borne optimale pour la programmation entière quasi-convexe
- The complexity of Tarski's fixed point theorem
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 Q3483265)
