Better pseudorandom generators from milder pseudorandom restrictions

DOI10.1109/FOCS.2012.77MaRDI QIDQ6988236zbMATH OpenFDO

Authors Parikshit Gopalan, Luca Trevisan, Omer Reingold, Raghu Meka, Salil Vadhan

Publication date 5 May 2025

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

Mathematics Subject Classification ID

Combinatorics (05-XX) Computer science (68-XX) Information and communication theory, circuits (94-XX)

Cited in

(5)

• Pseudorandomness, symmetry, smoothing: I
• Shrinkage of decision lists and DNF formulas
• Pseudodistributions that beat all pseudorandom generators
• Improved parallel derandomization via finite automata with applications
• Implications of better PRGs for permutation branching programs

This page was built for publication: Better pseudorandom generators from milder pseudorandom restrictions

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