Pages that link to "Item:Q4700178"

The following pages link to Computing roadmaps of semi-algebraic sets on a variety (Q4700178):

Displaying 23 items.

• Variant quantifier elimination (Q420753) (← links)
• 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)
• Algorithms to compute the topology of orientable real algebraic surfaces (Q1878477) (← links)
• Computing the Betti numbers of arrangements via spectral sequences (Q1886454) (← links)
• Polynomial hierarchy, Betti numbers, and a real analogue of Toda's theorem (Q1959088) (← links)
• Vandermonde varieties, mirrored spaces, and the cohomology of symmetric semi-algebraic sets (Q2088135) (← links)
• Numerical roadmap of smooth bounded real algebraic surface (Q2180637) (← links)
• Computing the homology of semialgebraic sets. I: Lax formulas (Q2291730) (← links)
• Special algorithm for stability analysis of multistable biological regulatory systems (Q2343243) (← links)
• Computing the first few Betti numbers of semi-algebraic sets in single exponential time (Q2457390) (← links)
• Counting complexity classes for numeric computations. II: Algebraic and semialgebraic sets (Q2489141) (← links)
• Positive dimensional parametric polynomial systems, connectivity queries and applications in robotics (Q2674013) (← links)
• Topology of real multi-affine hypersurfaces and a homological stability property (Q2699228) (← links)
• On a real analog of Bezout inequality and the number of connected components of sign conditions (Q2795904) (← links)
• Efficient algorithms for computing the Euler-Poincaré characteristic of symmetric semi-algebraic sets (Q4635358) (← links)
• Bounding the length of gradient trajectories (Q5028959) (← links)
• Persistent Homology of Semialgebraic Sets (Q6087751) (← links)
• Efficient simplicial replacement of semialgebraic sets (Q6103446) (← links)