Effective Pólya semi-positivity for non-negative polynomials on the simplex
From MaRDI portal
Publication:945921
DOI10.1016/j.jco.2008.01.003zbMath1151.14337OpenAlexW2083512217MaRDI QIDQ945921
Publication date: 19 September 2008
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jco.2008.01.003
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (2)
Cites Work
- Unnamed Item
- On the complexity of Schmüdgen's Positivstellensatz
- A quantitative Pólya's theorem with zeros
- Representing polynomials by positive linear functions on compact convex polyhedra
- An effective version of Pólya's theorem on positive definite forms
- Certificates for nonnegativity of polynomials with zeros on compact semialgebraic sets
- Approximation of the Stability Number of a Graph via Copositive Programming
- A quantitative Pólya's Theorem with corner zeros
- Deciding eventual positivity of polynomials
- Optimization of Polynomials on Compact Semialgebraic Sets
- Divisors of polynomials and power series with positive coefficients
- A new bound for Pólya's theorem with applications to polynomials positive on polyhedra.
- An algorithmic approach to Schmüdgen's Positivstellensatz
This page was built for publication: Effective Pólya semi-positivity for non-negative polynomials on the simplex