Pages that link to "Item:Q5957271"
From MaRDI portal
The following pages link to An algorithmic approach to Schmüdgen's Positivstellensatz (Q5957271):
Displayed 9 items.
- An algebraic certificate for Budan's theorem (Q531342) (← links)
- On the complexity of Putinar's Positivstellensatz (Q870344) (← links)
- On the complexity of Schmüdgen's Positivstellensatz (Q876820) (← links)
- Effective Pólya semi-positivity for non-negative polynomials on the simplex (Q945921) (← links)
- A quantitative Pólya's theorem with zeros (Q1030259) (← links)
- Pólya's theorem with zeros (Q2275902) (← links)
- Certificates for nonnegativity of polynomials with zeros on compact semialgebraic sets (Q2388440) (← links)
- Algorithms for quadratic forms (Q2474250) (← links)
- A new bound for Pólya's theorem with applications to polynomials positive on polyhedra. (Q5951566) (← links)