Divide and conquer roadmap for algebraic sets

DOI10.1007/s00454-014-9610-9zbMath1329.14109arXiv1305.3211OpenAlexW1984254060MaRDI QIDQ464736

Marie-Françoise Roy, Saugata Basu

Publication date: 29 October 2014

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1305.3211

zbMATH Keywords

complexityreal algebraic varietiesdivde and conquer algorithmreal univariate representationroadmaps

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Real algebraic sets (14P05) Effectivity, complexity and computational aspects of algebraic geometry (14Q20)

Related Items (7)

Numerical roadmap of smooth bounded real algebraic surface ⋮ Positive dimensional parametric polynomial systems, connectivity queries and applications in robotics ⋮ Algorithm for Connectivity Queries on Real Algebraic Curves ⋮ Computing roadmaps in unbounded smooth real algebraic sets. I: Connectivity results ⋮ Topology of real multi-affine hypersurfaces and a homological stability property ⋮ Vandermonde varieties, mirrored spaces, and the cohomology of symmetric semi-algebraic sets ⋮ Bounding the length of gradient trajectories

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A baby step-giant step roadmap algorithm for general algebraic sets
• A baby steps/giant steps probabilistic algorithm for computing roadmaps in smooth bounded real hypersurface
• On the Piano Movers problem. II: General techniques for computing topological properties of real algebraic manifolds
• Counting connected components of a semialgebraic set in subexponential time
• Problems and theorems in analysis II. Theory of functions, zeros, polynomials, determinants, number theory, geometry. Transl. from the German by C. E. Billigheimer.
• Construction of roadmaps in semi-algebraic sets
• BOUNDS FOR GRADIENT TRAJECTORIES AND GEODESIC DIAMETER OF REAL ALGEBRAIC SETS
• Computing roadmaps of semi-algebraic sets on a variety
• On the Minimum of a Polynomial Function on a Basic Closed Semialgebraic Set and Applications
• On the Betti Numbers of Real Varieties
• Algorithms in real algebraic geometry

This page was built for publication: Divide and conquer roadmap for algebraic sets