Explicit OR-dispersers with polylogarithmic degree

DOI10.1145/273865.273915zbMath0902.68081OpenAlexW2068751483MaRDI QIDQ3841042

Aravind Srinivasan, Michael E. 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)

Related Items (3)

Extractors for weak random sources and their applications ⋮ An Introduction to Randomness Extractors ⋮ Extracting all the randomness and reducing the error in Trevisan's extractors

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