What is the simple test with exponential polynomials to determine whether $$f(x)=e^x+ax^2+bx+c$$ has a positive zero?
This was prompted by the question about discriminants here. We have an ineffective result, a partial result, and a result for a broader class of algorithms.
As an ineffective result: According to Wilkie's 1996 paper, there must be a list of exponential polynomials in $a,b,c$ whose signs will determine whether $f$ has a positive zero. However, that paper does not provide an effective algorithm. It might be possible to get a similar ineffective result more simply using compactness and some of the arguments below.
As a partial result: If $a=0$, then $f$ has a zero iff one of the following holds: \begin{align} &b>0 \\ &b=0\ \ \&\ \ c<0 \\ &b<0\ \ \&\ \ b + e^{1-c/b}<0 \end{align} The last of these comes from using calculus to find the minimum of $f$, evaluating $f$ there, and replacing the logs in the expression with exponentials.
As a result with a broader class of algorithms: We can test this for any algebraic $a,b,c$. Check for each positive rational $q$ if $$e^q+aq^2+bq+c<0$$ and check for each natural $n$ if $$\forall x(x>0\implies ax^2+bx+c+\sum^n_{k=0}x^k/k!\ge0)$$ We can test the first piece using the proof of the transcendence of $e$ (like this answer); if $f$ goes negative we will eventually verify that. We can test the second piece using Tarski-Seidenberg quantifier elimination; if $f$ is always positive we will eventually verify that. The third possibility, that $f$ is tangent to the $x$-axis, would imply that $f$ and $f'$ have a simultaneous zero, and we can rule that out by the Lindemann-Weierstrass theorem. However, this is an algorithm without an obvious time bound. And even if we convert each of the subtests above into a test via exponential polynomials, this doesn't give a single set of exponential polynomials which can be used for all $a,b,c$.
What is the single set of exponential polynomials in $a,b,c$ whose signs determine if $f$ has a positive zero?