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.

Convergence theorems form the backbone of probability theory and statistical inference, ensuring that sequences of random variables behave in a predictable manner as their index grows. These theorems, ...