Complexity and real computation
Complexity and real computation
Random polynomials and expected complexity of bisection methods for real solving
Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
| Hi-index | 0.00 |
We prove that the real roots of normal random homogeneous polynomial systems with n+1 variables and given degrees are, in some sense, equidistributed in the projective space P(R^n^+^1). From this fact we compute the average number of real roots of normal random polynomial systems given in the Bernstein basis.