It is shown that under fairly mild conditions linear combinations of independent normally distributed random variables with random coefficients tend to zero almost everywhere. The result is applied to ...

Discrete combinatorial optimization has a central role in many scientific disciplines, however, for hard problems we lack linear time algorithms that would allow us to solve very large instances.