Pseudorandom bits for low degree modular polynomials @SimonsInstitute
Pseudorandom bits for low degree modular polynomials  @SimonsInstitute
Uploaded October 2026 | Updated November 2026, 2 days ago
Tejas Nareddy (Northeastern University)
https://simons.berkeley.edu/talks/tejas-nareddy-northeastern-university-2026-10-30
Derandomization
Pseudorandom bits for low degree modular polynomialsLightning TalksAgent Arena: Causal Evaluations of Agents in the Real WorldHow did we miss the random purification channel?Simple pseudorandom constructions in algebraThe unreasonable effectiveness of the convexity assumption in high dimensions
Simons Institute for the Theory of Computing |

Pseudorandom bits for low degree modular polynomials

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER