Is there any strongly polynomial time algorithm to check nonnegativity of a univariate polynomial?

Question

There are algorithms which can do this e.g. GCD based techniques, but their running time depends on the description length of the coefficients. I am trying to find out if there exists an algorithm do determine this whose running time does not depend of the description length of the coefficients.