An algorithmic approach to Schmüdgen's Positivstellensatz
From MaRDI portal
Publication:5957271
DOI10.1016/S0022-4049(01)00041-XzbMath1015.14031MaRDI QIDQ5957271
Publication date: 13 March 2003
Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)
Related Items
A new bound for Pólya's theorem with applications to polynomials positive on polyhedra., Constructive proofs of some positivstellensätze for compact semialgebraic subsets of \(\mathbb R^{d }\), An algebraic certificate for Budan's theorem, On the complexity of Putinar's Positivstellensatz, On the complexity of Schmüdgen's Positivstellensatz, Effective Pólya semi-positivity for non-negative polynomials on the simplex, A quantitative Pólya's theorem with zeros, Pólya's theorem with zeros, Certificates for nonnegativity of polynomials with zeros on compact semialgebraic sets, Algorithms for quadratic forms
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Zum Darstellungssatz von Kadison-Dubois
- Representing polynomials by positive linear functions on compact convex polyhedra
- Gröbner bases and primary decomposition of polynomial ideals
- The \(K\)-moment problem for compact semi-algebraic sets
- Using Gröbner bases to determine algebra membership, split surjective algebra homomorphisms determine birational equivalence
- An effective version of Pólya's theorem on positive definite forms
- Anneaux preordonnes
- A note on David Harrison's theory of reprimes
- A Nullstellensatz and a Positivstellensatz in semialgebraic geometry
- Complexity estimates for the Schmüdgen Positivstellensatz
- Partial orders on a field and valuation rings
- A representation theory for commutative topological algebra
