scientific article; zbMATH DE number 589123

MaRDI QIDQ4295432zbMATH OpenFDO

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

Publication date 30 September 1999

zbMATH Keywords

computational algebraic geometrypath finding algorithmssemi-algebraic pathsemi-algebraically connected component

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 17838
• scientific article; zbMATH DE number 27176
• Computing Roadmaps of General Semi-Algebraic Sets
• Description of the connected components of a semialgebraic set in single exponential time
• scientific article; zbMATH DE number 1256732

Cited in

(18)

• 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
• Bounds for the geodesic diameter of connection components of semi-algebraic open sets
• scientific article; zbMATH DE number 17838 (Why is no real title available?)
• Divide and conquer roadmap for algebraic sets
• Computing roadmaps of semi-algebraic sets on a variety
• A baby step-giant step roadmap algorithm for general algebraic sets
• Finding connected components of a semialgebraic set in subexponential time
• A baby steps/giant steps probabilistic algorithm for computing roadmaps in smooth bounded real hypersurface
• Efficient computation of a semi-algebraic basis of the first homology group of a semi-algebraic set
• On the computation of the homology of semialgebraic sets
• Smooth connectivity in real algebraic varieties
• Connectivity in symmetric semi-algebraic sets
• Computing roadmaps in unbounded smooth real algebraic sets. II: Algorithm and complexity
• Deciding connectivity in symmetric semi-algebraic sets
• Using interval arithmetic to prove that a set is path-connected
• A numerical algorithm for zero counting. I: Complexity and accuracy

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4295432)