Computing roadmaps in unbounded smooth real algebraic sets. II: Algorithm and complexity
From MaRDI portal
Cites work
- 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
- A Gröbner free alternative for polynomial system solving
- A Nearly Optimal Algorithm for Deciding Connectivity Queries in Smooth and Bounded Real Algebraic Sets
- Algorithm for Connectivity Queries on Real Algebraic Curves
- Algorithms in real algebraic geometry
- Basic algebraic geometry 1. Varieties in projective space. Translated from the Russian by Miles Reid
- Bit complexity for computing one point in each connected component of a smooth real algebraic set
- Bit complexity for multi-homogeneous polynomial system solving -- application to polynomial minimization
- Computing an equidimensional decomposition of an algebraic variety by means of geometric resolutions
- Computing roadmaps in unbounded smooth real algebraic sets. I: Connectivity results
- Computing Roadmaps of General Semi-Algebraic Sets
- Computing roadmaps of semi-algebraic sets on a variety
- Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers
- Construction of roadmaps in semi-algebraic sets
- Counting connected components of a semialgebraic set in subexponential time
- Deciding cuspidality of manipulators through computer algebra and algorithms in real algebraic geometry
- Divide and conquer roadmap for algebraic sets
- scientific article; zbMATH DE number 3897078 (Why is no real title available?)
- scientific article; zbMATH DE number 589123 (Why is no real title available?)
- scientific article; zbMATH DE number 704831 (Why is no real title available?)
- scientific article; zbMATH DE number 1057749 (Why is no real title available?)
- scientific article; zbMATH DE number 2151204 (Why is no real title available?)
- scientific article; zbMATH DE number 5049913 (Why is no real title available?)
- Ideals defined by matrices and a certain complex associated with them
- Le rôle des structures de données dans les problèmes d'élimination
- Matrix mathematics. Theory, facts, and formulas
- On the Piano Movers problem. II: General techniques for computing topological properties of real algebraic manifolds
- Polar varieties and efficient real elimination
- Positive dimensional parametric polynomial systems, connectivity queries and applications in robotics
- Robots, computer algebra and eight connected components
- Straight-line programs in geometric elimination theory
- The complexity of partial derivatives
This page was built for publication: Computing roadmaps in unbounded smooth real algebraic sets. II: Algorithm and complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7289907)
