An algorithmic approach to Schmüdgen's Positivstellensatz
Author:
- 1 January 2002
- journal article
- Published by Elsevier in Journal of Pure and Applied Algebra
- Vol. 166 (3) , 307-319
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Erratum to: “An effective version of Pólya's theorem on positive definite forms” [J. Pure Appl. Algebra 108 (1996) 231–240]Journal of Pure and Applied Algebra, 2001
- An effective version of Pólya's theorem on positive definite formsJournal of Pure and Applied Algebra, 1996
- Using Gröbner bases to determine algebra membership, split surjective algebra homomorphisms determine birational equivalenceJournal of Symbolic Computation, 1988
- Gröbner bases and primary decomposition of polynomial idealsJournal of Symbolic Computation, 1988
- Representing polynomials by positive linear functions on compact convex polyhedraPacific Journal of Mathematics, 1988
- Zum Darstellungssatz von Kadison-DuboisArchiv der Mathematik, 1983
- Partial orders on a field and valuation ringsCommunications in Algebra, 1979
- A nullstellensatz and a positivstellensatz in semialgebraic geometryMathematische Annalen, 1974
- A note on David Harrison’s theory of preprimesPacific Journal of Mathematics, 1967
- Über die Zerlegung strikte definiter Formen in QuadrateCommentarii Mathematici Helvetici, 1939