Average polynomial time for eigenvector computations
  We describe two algorithms for the eigenvalue, eigenvector problem which, on input a Gaussian matrix with complex entries, finish with probability 1 and in average polynomial time. 
Diego Armentano, Carlos Beltr\'an, Michael Shub
math.NA