We propose an algorithm to decide if a real algebraic set defined by polynomials with integer coefficients has a non empty intersection with a given ball by the index formula of Kronecker. We approximate the integral by a Riemann sum and we give an estimate of the time of computation which is needed. The method is well adapted to the use of parallel time computations.