Christopher Williamson

activity

20152021

most citedBounds on Geometric Eigenvalues of Graphs

1 citations · 2 across the 2 of their papers we have counts for

collaborators

Showing cs.CCShow all

2 papers · 1 filter

cs.CC2021★ 1 cited

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…

cs.CC2019

Approximate degree, secret sharing, and concentration phenomena

Andrej Bogdanov, Nikhil S. Mande, Justin Thaler +1

The $ε$ -approximate degree $d e g_{ε} (f)$ of a Boolean function $f$ is the least degree of a real-valued polynomial that approximates $f$ pointwise to error $ε$ . The approximate degree…