Publication:4295432
From MaRDI portal
zbMath0921.14039MaRDI QIDQ4295432
Pablo Solernó, Joos Heintz, Marie-Françoise Roy
Publication date: 30 September 1999
computational algebraic geometry; semi-algebraically connected component; path finding algorithms; semi-algebraic path
68Q25: Analysis of algorithms and problem complexity
14P10: Semialgebraic sets and related spaces
14Q20: Effectivity, complexity and computational aspects of algebraic geometry
Related Items
Computing roadmaps of semi-algebraic sets on a variety, Finding connected components of a semialgebraic set in subexponential time, Divide and conquer roadmap for algebraic sets, 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 numerical algorithm for zero counting. I: Complexity and accuracy, Construction of roadmaps in semi-algebraic sets, Algorithms to compute the topology of orientable real algebraic surfaces, Computing the homology of semialgebraic sets. I: Lax formulas