Pages that link to "Item:Q2251913"
From MaRDI portal
The following pages link to Intrinsic complexity estimates in polynomial optimization (Q2251913):
Displayed 9 items.
- Bit complexity for multi-homogeneous polynomial system solving -- application to polynomial minimization (Q1690788) (← links)
- Homotopy techniques for solving sparse column support determinantal polynomial systems (Q1979422) (← links)
- On exact Reznick, Hilbert-Artin and Putinar's representations (Q2029015) (← links)
- Computing critical points for invariant algebraic systems (Q2100065) (← links)
- Solving determinantal systems using homotopy techniques (Q2229744) (← links)
- Exact algorithms for semidefinite programs with degenerate feasible set (Q2229751) (← links)
- Sum of Squares Decompositions of Polynomials over their Gradient Ideals with Rational Coefficients (Q5883314) (← links)
- Refined F5 Algorithms for Ideals of Minors of Square Matrices (Q6081937) (← links)
- Faster real root decision algorithm for symmetric polynomials (Q6081968) (← links)