Extractors and Lower Bounds for Locally Samplable Sources

DOI10.1145/2141938.2141941zbMath1322.65009OpenAlexW2107041607MaRDI QIDQ5892186

No author found.

Publication date: 24 September 2015

Published in: ACM Transactions on Computation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2141938.2141941

zbMATH Keywords

lower boundsextractorslocally samplable sources

Mathematics Subject Classification ID

Random number generation in numerical analysis (65C10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

Unnamed Item ⋮ The complexity of estimating min-entropy

This page was built for publication: Extractors and Lower Bounds for Locally Samplable Sources