The following pages link to (Q4232468):
Displaying 21 items.
- Proving inequalities and solving global optimization problems via simplified CAD projection (Q492036) (← links)
- An asymptotically tight bound on the number of semi-algebraically connected components of realizable sign conditions (Q987564) (← links)
- Complexity of computing the local dimension of a semialgebraic set (Q1300630) (← links)
- Description of the connected components of a semialgebraic set in single exponential time (Q1317872) (← links)
- Complexity of finding irreducible components of a semialgebraic set (Q1346599) (← links)
- On computing a set of points meeting every cell defined by a family of polynomials on a variety (Q1361873) (← links)
- Computing with semi-algebraic sets: relaxation techniques and effective boundaries (Q1940931) (← links)
- Bit complexity for computing one point in each connected component of a smooth real algebraic set (Q2100045) (← links)
- Semi-algebraic complexity of quotients and sign determination of remainders (Q2365423) (← links)
- Generalized polar varieties: geometry and algorithms (Q2387411) (← links)
- \(N\)-dimensional versus \((N-1)\)-dimensional connectivity testing of first-order queries to semi-algebraic sets (Q2576661) (← links)
- Counting complexity classes for numeric computations II (Q3580991) (← links)
- Counting connected components of a semi-algebraic set in single exponential time (Q3971133) (← links)
- (Q3980333) (← links)
- Polynomial-time computable approximation of families of semialgebraic sets and combinatorial complexity (Q4005386) (← links)
- (Q4227319) (← links)
- Complexity of deciding connectivity in real algebraic sets (Q5244507) (← links)
- (Q5389777) (← links)
- (Q5460918) (← links)
- Finding connected components of a semialgebraic set in subexponential time (Q5966655) (← links)
- A connected component labeling algorithm for implicitly defined domains (Q6161317) (← links)
