scientific article; zbMATH DE number 589123

zbMath0921.14039MaRDI QIDQ4295432

Pablo Solernó, Joos Heintz, Marie-Françoise Roy

Publication date: 30 September 1999

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

computational algebraic geometrysemi-algebraically connected componentpath finding algorithmssemi-algebraic path

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Semialgebraic sets and related spaces (14P10) Effectivity, complexity and computational aspects of algebraic geometry (14Q20)

Related Items

Algorithms to compute the topology of orientable real algebraic surfaces, A baby steps/giant steps probabilistic algorithm for computing roadmaps in smooth bounded real hypersurface, Divide and conquer roadmap for algebraic sets, A baby step-giant step roadmap algorithm for general algebraic sets, A numerical algorithm for zero counting. I: Complexity and accuracy, Computing the homology of semialgebraic sets. I: Lax formulas, Computing roadmaps of semi-algebraic sets on a variety, Finding connected components of a semialgebraic set in subexponential time, Construction of roadmaps in semi-algebraic sets