Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > SAMPLEABLE DISTRIBUTIONS:
Reports tagged with sampleable distributions:
TR24-180 | 13th November 2024
Daniel Kane, Anthony Ostuni, Kewen Wu

Locally Sampleable Uniform Symmetric Distributions

We characterize the power of constant-depth Boolean circuits in generating uniform symmetric distributions. Let $f\colon\{0,1\}^m\to\{0,1\}^n$ be a Boolean function where each output bit of $f$ depends only on $O(1)$ input bits. Assume the output distribution of $f$ on uniform input bits is close to a uniform distribution $\mathcal D$ with ... more >>>




ISSN 1433-8092 | Imprint