Let there be a set of $P$ polynomial equations $f_j(x_1,x_2...x_V)=0$ where $1\leq j\leq P$. For each $f_j$ the coefficients are real and every variable goes up to degree $D$. It is also guaranteed that every root of every $f_j$ is guaranteed to be real.
If we want to numerically find a solution $\{X_1,X_2,..,X_V\}$ to the set of polynomials within accuracy $\varepsilon$, what is the $\mathcal{O}()$ cost for this? What's the computational cost?
The coefficients are real, irrational but efficiently calculable. I'm not sure how specific I can get, but they're fractions and square-roots.
For some reason I'm having trouble finding this answer; my advisor seems to think it should be very easy to find. If possible I'd really like to find a source for the information as well.