Extractors for Circuit Sources

DOI10.1109/FOCS.2011.20zbMath1292.68117MaRDI QIDQ5494966

Emanuele Viola

Publication date: 30 July 2014

Published in: 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (7)

Improving the Hadamard extractor ⋮ Bounded-depth circuits cannot sample good codes ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Extractors and Lower Bounds for Locally Samplable Sources ⋮ Unnamed Item ⋮ The complexity of estimating min-entropy

This page was built for publication: Extractors for Circuit Sources