The following pages link to (Q4137157):
Displayed 21 items.
- Computing the homology of real projective sets (Q667646) (← links)
- Definability and fast quantifier elimination in algebraically closed fields (Q798314) (← links)
- A numerical algorithm for zero counting. I: Complexity and accuracy (Q958246) (← links)
- Some lower bounds for the complexity of the linear programming feasibility problem over the reals (Q998976) (← links)
- Estimates of real roots of a system of algebraic equations (Q1077879) (← links)
- A bibliography of quantifier elimination for real closed fields (Q1103610) (← links)
- Solving systems of polynomial inequalities in subexponential time (Q1113939) (← links)
- Effective Łojasiewicz inequalities in semialgebraic geometry (Q1177863) (← links)
- The complexity of deciding consistency of systems of polynomials in exponent inequalities (Q1190747) (← links)
- Complexity of deciding Tarski algebra (Q1264143) (← links)
- An effective algorithm for quantifier elimination over algebraically closed fields using straight line programs (Q1295548) (← links)
- Description of the connected components of a semialgebraic set in single exponential time (Q1317872) (← links)
- Grid methods in computational real algebraic (and semialgebraic) geometry (Q1754715) (← links)
- Complexity of stratifications of semi-Pfaffian sets (Q1894719) (← links)
- On exact Reznick, Hilbert-Artin and Putinar's representations (Q2029015) (← links)
- Computing the homology of semialgebraic sets. II: General formulas (Q2052718) (← links)
- Complexity of deciding the first-order theory of real closed fields (Q2277024) (← links)
- Computing the homology of semialgebraic sets. I: Lax formulas (Q2291730) (← links)
- Semidefinite Approximations of Projections and Polynomial Images of SemiAlgebraic Sets (Q3451759) (← links)
- Complexity of cylindrical decompositions of sub-Pfaffian (Q5951564) (← links)
- Finding connected components of a semialgebraic set in subexponential time (Q5966655) (← links)