Pages that link to "Item:Q1311619"
From MaRDI portal
The following pages link to Construction of roadmaps in semi-algebraic sets (Q1311619):
Displaying 13 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)
- 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)
- Description of the connected components of a semialgebraic set in single exponential time (Q1317872) (← links)
- Algorithms to compute the topology of orientable real algebraic surfaces (Q1878477) (← links)
- Polynomial hierarchy, Betti numbers, and a real analogue of Toda's theorem (Q1959088) (← links)
- Numerical roadmap of smooth bounded real algebraic surface (Q2180637) (← links)
- Computing the first few Betti numbers of semi-algebraic sets in single exponential time (Q2457390) (← links)
- Efficient algorithms for computing the Euler-Poincaré characteristic of symmetric semi-algebraic sets (Q4635358) (← links)
- Computing roadmaps of semi-algebraic sets on a variety (Q4700178) (← links)