Computing roadmaps of semi-algebraic sets on a variety
From MaRDI portal
Publication:4700178
DOI10.1090/S0894-0347-99-00311-2zbMATH Open0933.14037OpenAlexW1589087843MaRDI QIDQ4700178FDOQ4700178
Authors: Saugata Basu, Richard Pollack, Marie-Françoise Roy 
Publication date: 1 November 1999
Published in: Journal of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0894-0347-99-00311-2
Recommendations
Symbolic computation and algebraic computation (68W30) Analysis of algorithms (68W40) Semialgebraic sets and related spaces (14P10)
Cites Work
- Morse Theory. (AM-51)
- Nash triviality in families of Nash manifolds
- Title not available (Why is that?)
- Finding at least one point in each connected component of a real algebraic set defined by a single equation
- On the combinatorial and algebraic complexity of quantifier elimination
- On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination
- Constructing roadmaps of semi-algebraic sets. I: Completeness
- On computing a set of points meeting every cell defined by a family of polynomials on a variety
- Computing Roadmaps of General Semi-Algebraic Sets
- Thom's lemma, the coding of real algebraic numbers and the computation of the topology of semi-algebraic sets
- Title not available (Why is that?)
- Construction of roadmaps in semi-algebraic sets
- Counting connected components of a semialgebraic set in subexponential time
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the Piano Movers problem. II: General techniques for computing topological properties of real algebraic manifolds
- Semi-Algebraic Local-Triviality in Semi-Algebraic Mappings
- Finding irreducible components of some real transcendental varieties
- Finding connected components of a semialgebraic set in subexponential time
- Title not available (Why is that?)
Cited In (34)
- Efficient algorithms for computing the Euler-Poincaré characteristic of symmetric semi-algebraic sets
- Computing Roadmaps of Semi-algebraic Sets on a Variety (Extended Abstract)
- Computing the first few Betti numbers of semi-algebraic sets in single exponential time
- A baby steps/giant steps probabilistic algorithm for computing roadmaps in smooth bounded real hypersurface
- Title not available (Why is that?)
- Topology of real multi-affine hypersurfaces and a homological stability property
- Bounding the length of gradient trajectories
- Computing roadmaps in unbounded smooth real algebraic sets. I: Connectivity results
- Geodesic diameter of sets defined by few quadratic equations and inequalities
- Title not available (Why is that?)
- Title not available (Why is that?)
- Efficient simplicial replacement of semialgebraic sets
- Efficient computation of a semi-algebraic basis of the first homology group of a semi-algebraic set
- Algorithms to compute the topology of orientable real algebraic surfaces
- Divide and conquer roadmap for algebraic sets
- Special algorithm for stability analysis of multistable biological regulatory systems
- A baby step-giant step roadmap algorithm for general algebraic sets
- Computing the top Betti numbers of semialgebraic sets defined by quadratic inequalities in polynomial time
- Computing the Betti numbers of arrangements via spectral sequences
- Construction of roadmaps in semi-algebraic sets
- On a real analog of Bézout inequality and the number of connected components of sign conditions
- Algorithm for Connectivity Queries on Real Algebraic Curves
- Positive dimensional parametric polynomial systems, connectivity queries and applications in robotics
- Title not available (Why is that?)
- Computing the homology of semialgebraic sets. I: Lax formulas
- Numerical roadmap of smooth bounded real algebraic surface
- Computing Roadmaps of General Semi-Algebraic Sets
- Computing the Betti numbers of semi-algebraic sets defined by partly quadratic systems of polynomials
- Persistent Homology of Semialgebraic Sets
- Computing roadmaps in smooth real algebraic sets
- Counting complexity classes for numeric computations. II: Algebraic and semialgebraic sets
- Vandermonde varieties, mirrored spaces, and the cohomology of symmetric semi-algebraic sets
- Variant quantifier elimination
- Computing the first Betti number of a semi-algebraic set
This page was built for publication: Computing roadmaps of semi-algebraic sets on a variety
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4700178)
