Locally Sampleable Uniform Symmetric Distributions
Open Access
- 15 June 2025
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 1807-1816
Abstract
No abstract availableAll Related Versions
Funding Information
- NSF (National Science Foundation) (CCF-2107547, CCF-1553288, CCF-2145474)
- Sloan (Research Fellowship)
This publication has 30 references indexed in Scilit:
- Quantum advantage with noisy shallow circuitsNature Physics, 2020
- Extractors for Near Logarithmic Min-Entropy2016
- Large Deviation Bounds for Decision Trees and Sampling Lower Bounds for AC0-Circuits2012
- Extractors for Turing-Machine Sources2012
- Bounded-Depth Circuits Cannot Sample Good Codes2011
- Elements of Information Theory2005
- Fast parallel generation of random permutationsLecture Notes in Computer Science, 1991
- Random oracles separate PSPACE from the polynomial-time hierarchyInformation Processing Letters, 1987
- One-way functions and circuit complexityInformation and Computation, 1987
- Random generation of combinatorial structures from a uniform distributionTheoretical Computer Science, 1986