Pages that link to "Item:Q486687"

The following pages link to A baby step-giant step roadmap algorithm for general algebraic sets (Q486687):

Displaying 16 items.

• Divide and conquer roadmap for algebraic sets (Q464736) (← links)
• Homotopy techniques for solving sparse column support determinantal polynomial systems (Q1979422) (← links)
• Bit complexity for computing one point in each connected component of a smooth real algebraic set (Q2100045) (← links)
• Computing critical points for invariant algebraic systems (Q2100065) (← links)
• Numerical roadmap of smooth bounded real algebraic surface (Q2180637) (← links)
• Solving determinantal systems using homotopy techniques (Q2229744) (← links)
• Computing real witness points of positive dimensional polynomial systems (Q2357373) (← links)
• Positive dimensional parametric polynomial systems, connectivity queries and applications in robotics (Q2674013) (← links)
• Topology of real multi-affine hypersurfaces and a homological stability property (Q2699228) (← links)
• A Numerical Method for Computing Border Curves of Bi-parametric Real Polynomial Systems and Applications (Q2829998) (← links)
• (Q3983701) (← links)
• A Geometric Approach for Analyzing Parametric Biological Systems by Exploiting Block Triangular Structure (Q5090111) (← links)
• On the Central Path of Semidefinite Optimization: Degree and Worst-Case Convergence Rate (Q5864697) (← links)
• Persistent Homology of Semialgebraic Sets (Q6087751) (← links)
• Computing roadmaps in unbounded smooth real algebraic sets. I: Connectivity results (Q6170822) (← links)
• Efficient computation of a semi-algebraic basis of the first homology group of a semi-algebraic set (Q6624170) (← links)