Extractors for Circuit Sources

DOI10.1109/FOCS.2011.20MaRDI QIDQ5494966zbMATH OpenFDO

Authors Emanuele Viola

Publication date 30 July 2014

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

Full work available at URL https://doi.org/10.1109/FOCS.2011.20

Mathematics Subject Classification ID

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

Cited in

(8)

• Improving the Hadamard extractor
• The complexity of estimating min-entropy
• Extractors for polynomial sources over fields of constant order and small characteristic
• How to subvert backdoored encryption: security against adversaries that decrypt all ciphertexts
• scientific article; zbMATH DE number 7561745 (Why is no real title available?)
• Extractors and lower bounds for locally samplable sources
• Limits of preprocessing
• Bounded-depth circuits cannot sample good codes

This page was built for publication: Extractors for Circuit Sources

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5494966)