Almost optimal lower bounds for small depth circuits
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Unbiased bits from sources of weak randomness and probabilistic communication complexity
SIAM Journal on Computing - Special issue on cryptography
Journal of Computer and System Sciences
Extracting randomness from samplable distributions
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Extractors with weak random seeds
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Deterministic Extractors for Bit-Fixing Sources and Exposure-Resilient Cryptography
SIAM Journal on Computing
Deterministic Extractors for Bit-Fixing Sources by Obtaining an Independent Seed
SIAM Journal on Computing
Extracting Randomness Using Few Independent Sources
SIAM Journal on Computing
The bit extraction problem or t-resilient functions
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Extractors And Rank Extractors For Polynomial Sources
Computational Complexity
Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes
Journal of the ACM (JACM)
Extractors for Low-Weight Affine Sources
CCC '09 Proceedings of the 2009 24th Annual IEEE Conference on Computational Complexity
CCC '09 Proceedings of the 2009 24th Annual IEEE Conference on Computational Complexity
Extractors for a Constant Number of Polynomially Small Min-Entropy Independent Sources
SIAM Journal on Computing
Simulating independence: New constructions of condensers, ramsey graphs, dispersers, and extractors
Journal of the ACM (JACM)
Simple Affine Extractors Using Dimension Expansion
CCC '10 Proceedings of the 2010 IEEE 25th Annual Conference on Computational Complexity
Deterministic extractors for small-space sources
Journal of Computer and System Sciences
The Complexity of Distributions
FOCS '10 Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
Improved Constructions of Three Source Extractors
CCC '11 Proceedings of the 2011 IEEE 26th Annual Conference on Computational Complexity
A New Approach to Affine Extractors and Dispersers
CCC '11 Proceedings of the 2011 IEEE 26th Annual Conference on Computational Complexity
The Complexity of Distributions
SIAM Journal on Computing
Hi-index | 0.00 |
We consider the problem of extracting randomness from sources that are efficiently samplable, in the sense that each output bit of the sampler only depends on some small number d of the random input bits. As our main result, we construct a deterministic extractor that, given any d-local source with min-entropy k on n bits, extracts Ω(k2/nd) bits that are 2-nΩ(1)-close to uniform, provided d ≤ o(log n) and k ≥ n2/3+γ (for arbitrarily small constants γ 0). Using our result, we also improve a result of Viola (FOCS 2010), who proved a 1/2-O(1/ log n) statistical distance lower bound for o(log n)-local samplers trying to sample inputoutput pairs of an explicit boolean function, assuming the samplers use at most n+n1-δ random bits for some constant δ 0. Using a different function, we simultaneously improve the lower bound to 1/2 - 2-nΩ(1) and eliminate the restriction on the number of random bits.