We show that there are algorithms which find an approximate zero of a
system of polynomial equations and which function in polynomial time o
n the average. The number of arithmetic operations is cN(4s), where N
is the input size and c a universal constant.