1 citations · 2 across the 6 of their papers we have counts for
7 papers
Secret Sharing at the Shannon Ceiling
Christopher Williamson
For every that is a multiple of 3, we construct an explicit access structure on participants. In every perfect secret-sharing scheme realising this access structure,…
Finite Three-Colourable (0,2)-Graphs Are Bipartite
Christopher Williamson
A theorem of Payan says that a cubelike graph cannot have chromatic number exactly three. A nearby question, usually discussed as Payan's finite -graph question, asks whethe…
Symmetric Bounded Indistinguishability: Hypergeometric Smoothing and Hahn Polynomials
Christopher Williamson
A pair of probability distributions over is said to be -wise indistinguishable if all of the size marginals are within statistical distance at most . Prev…
Extremal poker hand rankings: why the standard 52 card deck and a 3044 card deck are special
Christopher Williamson
We study poker hand rankings in the partially generalised setting of a deck with ranks, rather than the typical 13 ranks. We provide the hand rankings for all and observe s…
Sharp indistinguishability bounds from non-uniform approximations
Christopher Williamson
We study the problem of distinguishing between two symmetric probability distributions over bits by observing bits of a sample, subject to the constraint that all -wis…
Approximate degree, secret sharing, and concentration phenomena
Andrej Bogdanov, Nikhil S. Mande, Justin Thaler +1
The -approximate degree of a Boolean function is the least degree of a real-valued polynomial that approximates pointwise to error . The approximate degree…