Since the standard union bound for space-time codes may diverge in quasi-static fading channels, the limit-before-average technique has been exploited to derive tight performance b...
We show that enumerating all minimal spanning and connected subsets of a given matroid is quasi-polynomially equivalent to the well-known hypergraph transversal problem, and thus ...
Leonid Khachiyan, Endre Boros, Konrad Borys, Khale...
In this paper we study planar polynomial differential systems of this form: dX dt = X = A(X, Y ), dY dt = Y = B(X, Y ), where A, B Z[X, Y ] and deg A d, deg B d, A H and B H. ...
In this paper, we present the first average-case analysis proving an expected polynomial running time for an exact algorithm for the 0/1 knapsack problem. In particular, we prove,...