  We propose a more general definition of generic-case complexity, based on
using a random process for generating inputs of an algorithm and using the time
needed to generate an input as a way of measuring the size of that input.
