The following pages link to (Q3980333):
Displaying 9 items.
- 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)
- \(N\)-dimensional versus \((N-1)\)-dimensional connectivity testing of first-order queries to semi-algebraic sets (Q2576661) (← links)
- A Nearly Optimal Algorithm for Deciding Connectivity Queries in Smooth and Bounded Real Algebraic Sets (Q3177875) (← links)
- Counting connected components of a semi-algebraic set in single exponential time (Q3971133) (← links)
- Polynomial-time computable approximation of families of semialgebraic sets and combinatorial complexity (Q4005386) (← links)
- Complexity of deciding connectivity in real algebraic sets (Q5244507) (← links)
- Finding connected components of a semialgebraic set in subexponential time (Q5966655) (← links)
- Computing roadmaps in unbounded smooth real algebraic sets. I: Connectivity results (Q6170822) (← links)
