Pages that link to "Item:Q1690788"

The following pages link to Bit complexity for multi-homogeneous polynomial system solving -- application to polynomial minimization (Q1690788):

Displaying 9 items.

• On the bit complexity of polynomial system solving (Q1734694) (← links)
• Homotopy techniques for solving sparse column support determinantal polynomial systems (Q1979422) (← links)
• Multilinear polynomial systems: root isolation and bit complexity (Q1994888) (← 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)
• Solving parametric systems of polynomial equations over the reals through Hermite matrices (Q2117425) (← links)
• Real root finding for low rank linear matrices (Q2175227) (← links)
• Effective coefficient asymptotics of multivariate rational functions via semi-numerical algorithms for polynomial systems (Q2211202) (← links)
• Exact algorithms for semidefinite programs with degenerate feasible set (Q2229751) (← links)