scientific article; zbMATH DE number 3564960
From MaRDI portal
Publication:4137157
Cited in
(22)- Estimates of real roots of a system of algebraic equations
- A bibliography of quantifier elimination for real closed fields
- Solving systems of polynomial inequalities in subexponential time
- Effective Łojasiewicz inequalities in semialgebraic geometry
- The complexity of deciding consistency of systems of polynomials in exponent inequalities
- Complexity of deciding Tarski algebra
- An effective algorithm for quantifier elimination over algebraically closed fields using straight line programs
- Description of the connected components of a semialgebraic set in single exponential time
- Grid methods in computational real algebraic (and semialgebraic) geometry
- Complexity of stratifications of semi-Pfaffian sets
- On exact Reznick, Hilbert-Artin and Putinar's representations
- Computing the homology of semialgebraic sets. II: General formulas
- Complexity of deciding the first-order theory of real closed fields
- Computing the homology of semialgebraic sets. I: Lax formulas
- Semidefinite approximations of projections and polynomial images of semialgebraic sets
- Complexity of cylindrical decompositions of sub-Pfaffian
- Finding connected components of a semialgebraic set in subexponential time
- Computing the homology of real projective sets
- On the computation of the homology of semialgebraic sets
- Definability and fast quantifier elimination in algebraically closed fields
- A numerical algorithm for zero counting. I: Complexity and accuracy
- Some lower bounds for the complexity of the linear programming feasibility problem over the reals
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 Q4137157)
