Gabriela Jerónimo, Daniel Perrucci
We present a new positive lower bound for the minimum value taken by a polynomial P with integer coefficients in k variables over the standard simplex of , assuming that P is positive on the simplex. This bound depends only on the number of variables k, the degree d and the bitsize t of the coefficients of P and improves all the previous bounds for arbitrary polynomials which are positive over the simplex.
© 2001-2024 Fundación Dialnet · Todos los derechos reservados