The following pages link to (Q4295432):
Displayed 9 items.
- Divide and conquer roadmap for algebraic sets (Q464736) (← links)
- A baby step-giant step roadmap algorithm for general algebraic sets (Q486687) (← links)
- A baby steps/giant steps probabilistic algorithm for computing roadmaps in smooth bounded real hypersurface (Q629823) (← links)
- A numerical algorithm for zero counting. I: Complexity and accuracy (Q958246) (← links)
- Construction of roadmaps in semi-algebraic sets (Q1311619) (← links)
- Algorithms to compute the topology of orientable real algebraic surfaces (Q1878477) (← links)
- Computing the homology of semialgebraic sets. I: Lax formulas (Q2291730) (← links)
- Computing roadmaps of semi-algebraic sets on a variety (Q4700178) (← links)
- Finding connected components of a semialgebraic set in subexponential time (Q5966655) (← links)