Explicit OR-dispersers with polylogarithmic degree

DOI10.1145/273865.273915MaRDI QIDQ3841042zbMATH OpenOpenAlexFDO

Authors Aravind Srinivasan, Michael Saks, Shiyu Zhou

Publication date 10 December 1998

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL http://www.acm.org/pubs/contents/journals/jacm/1998-45/

zbMATH Keywords

bipartite multigraphRP algorithms

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• scientific article; zbMATH DE number 1263224
• Simulating independence: new constructions of condensers, Ramsey graphs, dispersers, and extractors
• Almost optimal dispersers

Cited in

(7)

• Almost optimal dispersers
• An introduction to randomness extractors
• scientific article; zbMATH DE number 3980487 (Why is no real title available?)
• scientific article; zbMATH DE number 1263224 (Why is no real title available?)
• Extractors for weak random sources and their applications
• Extracting all the randomness and reducing the error in Trevisan's extractors
• Simulating time with square-root space

This page was built for publication: Explicit OR-dispersers with polylogarithmic degree

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