Pages that link to "Item:Q3140561"
From MaRDI portal
The following pages link to Computing Roadmaps of General Semi-Algebraic Sets (Q3140561):
Displayed 19 items.
- Variant quantifier elimination (Q420753) (← links)
- A baby steps/giant steps probabilistic algorithm for computing roadmaps in smooth bounded real hypersurface (Q629823) (← links)
- Computing the top Betti numbers of semialgebraic sets defined by quadratic inequalities in polynomial time (Q937274) (← links)
- Computing the first Betti number of a semi-algebraic set (Q937278) (← links)
- Computing the Betti numbers of semi-algebraic sets defined by partly quadratic systems of polynomials (Q1024388) (← links)
- Numerically computing real points on algebraic sets (Q1956231) (← links)
- Polynomial hierarchy, Betti numbers, and a real analogue of Toda's theorem (Q1959088) (← links)
- Computing the homology of semialgebraic sets. I: Lax formulas (Q2291730) (← links)
- On soft predicates in subdivision motion planning (Q2354924) (← links)
- Computing the first few Betti numbers of semi-algebraic sets in single exponential time (Q2457390) (← links)
- Positive dimensional parametric polynomial systems, connectivity queries and applications in robotics (Q2674013) (← links)
- Computing roadmaps of semi-algebraic sets on a variety (Q4700178) (← links)
- On the number of cells defined by a family of polynomials on a variety (Q4895410) (← links)
- Bounding the length of gradient trajectories (Q5028959) (← links)
- Rods and Rings: Soft Subdivision Planner for R^3 x S^2. (Q5088973) (← links)
- Algorithm for Connectivity Queries on Real Algebraic Curves (Q6060394) (← links)
- Persistent Homology of Semialgebraic Sets (Q6087751) (← links)
- Efficient simplicial replacement of semialgebraic sets (Q6103446) (← links)
- Computing roadmaps in unbounded smooth real algebraic sets. I: Connectivity results (Q6170822) (← links)