Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
Abstract— Many techniques for constructing unitary spacetime constellations have been proposed. To minimize bit-error rate (BER) in a wireless communication system, constellation...
We investigate notions of randomness in the space C[2N ] of nonempty closed subsets of {0, 1}N . A probability measure is given and a version of the Martin-L¨of test for randomne...
George Barmpalias, Paul Brodhead, Douglas Cenzer, ...
A standard method for approximating averages in probabilistic models is to construct a Markov chain in the product space of the random variables with the desired equilibrium distr...
Discrepancy is a versatile bound in communication complexity which can be used to show lower bounds in the distributional, randomized, quantum, and even unbounded error models of ...