8 citations · 22 across the 12 of their papers we have counts for
Showing 2023 · cs.CCShow all
2 papers · 2 filters
cs.CC2023
On Hardness Assumptions Needed for "Extreme High-End'' PRGs and Fast Derandomization
Ronen Shaltiel, Emanuele Viola
The hardness vs.~randomness paradigm aims to explicitly construct pseudorandom generators that fool circuits of size , assuming the existence…
cs.CC2023★ 2 cited
On correlation bounds against polynomials
Peter Ivanov, Liam Pavlovic, Emanuele Viola
We study the fundamental challenge of exhibiting explicit functions that have small correlation with low-degree polynomials over . Our main contributions include: 1…