Solving systems of polynomial inequalities in subexponential time
Journal of Symbolic Computation
Hi-index | 0.00 |
We give a simplified proof and an improvement of a recent theorem of A. Grigoriev, placing an upper bound for the number of roots of linear combinations of solutions of systems of linear equations with polynomial or rational coefficients.