  This article study the average conditioning for a random underdetermined
polynomial system. The expected value of the moments of the condition number
are compared to the moments of the condition number of random matrices. An
expression for these moments is given by studying the kernel finding problem
for random matrices. Furthermore, the second moment of the Frobenius condition
number is computed.
