Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > KEYWORD > HARDCORE SETS:
Reports tagged with Hardcore Sets:
TR08-103 | 22nd November 2008
that if $D$ is a distribution over $\{ 0,1\}^n$ of min-entropy at least $n-k$,
then for every $S$ and $\epsilon$ there is a circuit $C$ of size at most