Sharp indistinguishability bounds from non-uniform approximations

Christopher Williamson

We study the problem of distinguishing between two symmetric probability distributions over $n$ bits by observing $k$ bits of a sample, subject to the constraint that all $k-1$-wis…