Nearly optimal pseudorandomness from hardness

DOI10.1109/FOCS46700.2020.00102MaRDI QIDQ6943953zbMATH OpenFDO

Authors Dean Doron, David Zuckerman, Justin Oh, Dana Moshkovitz

Publication date 12 August 2025

Full work available at URL https://doi.org/10.1109/FOCS46700.2020.00102

Mathematics Subject Classification ID

Proceedings, conferences, collections, etc. pertaining to computer science (68-06)

Cited in

(3)

• Size bounds on low depth circuits for promise majority
• Tight bounds on list-decodable and list-recoverable zero-rate codes
• Towards free lunch derandomization from necessary assumptions (and OWFs)

This page was built for publication: Nearly optimal pseudorandomness from hardness

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