An elementary recursive bound for effective Positivstellensatz and Hilbert's 17th problem

From MaRDI portal



Abstract: We prove elementary recursive bounds in the degrees for Positivstellensatz and Hilbert 17-th problem, which is the expression of a nonnegative polynomial as a sum of squares of rational functions. We obtain a tower of five exponentials. A precise bound in terms of the number and degree of the polynomials and their number of variables is provided in the paper.




Cites work









This page was built for publication: An elementary recursive bound for effective Positivstellensatz and Hilbert's 17th problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5108709)