Extractor Lower Bounds, Revisited
From MaRDI portal
Recommendations
- An Entropy Lower Bound for Non-Malleable Extractors
- Extractors and lower bounds for locally samplable sources
- Extractors and lower bounds for locally samplable sources
- scientific article; zbMATH DE number 2156273
- Extractor-based time-space lower bounds for learning
- Explicit constructions of extractors and expanders
- Exposure-resilient extractors and the derandomization of probabilistic sublinear time
- scientific article; zbMATH DE number 1820017
- Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators
- Space-bounded Kolmogorov extractors
Cites work
- An improved analysis of linear mergers
- Analyzing linear mergers
- Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators
- Explicit two-source extractors and resilient functions
- Extensions to the method of multiplicities, with applications to Kakeya sets and mergers
- Extractors
- Extractors for a Constant Number of Polynomially Small Min-Entropy Independent Sources
- Kakeya sets, new mergers, and old extractors
- New independent source extractors with exponential improvement
- Non-malleable extractors and codes, with their many tampered extensions
- On the Number of Iterations for Dantzig--Wolfe Optimization and Packing-Covering Approximation Algorithms
- Randomness is linear in space
This page was built for publication: Extractor Lower Bounds, Revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6084344)
