Pages that link to "Item:Q464735"
From MaRDI portal
The following pages link to A probabilistic symbolic algorithm to find the minimum of a polynomial function on a basic closed semialgebraic set (Q464735):
Displaying 5 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)
- Computing critical points for invariant algebraic systems (Q2100065) (← links)
- Solving determinantal systems using homotopy techniques (Q2229744) (← links)
- Intrinsic complexity estimates in polynomial optimization (Q2251913) (← links)
