Pseudorandomness for Read-Once Formulas
From MaRDI portal
Publication:5494968
DOI10.1109/FOCS.2011.57zbMath1292.68110MaRDI QIDQ5494968
Andrew Wan, Andrej Bogdanov, Periklis A. Papakonstantinou
Publication date: 30 July 2014
Published in: 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (Search for Journal in Brave)
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (9)
A dichotomy for local small-bias generators ⋮ Cryptographic hardness of random local functions. Survey ⋮ Pseudorandom generators for combinatorial checkerboards ⋮ Paradigms for Unconditional Pseudorandom Generators ⋮ Pseudorandom Pseudo-distributions with Near-Optimal Error for Read-Once Branching Programs ⋮ Bounded Independence Plus Noise Fools Products ⋮ Near-optimal pseudorandom generators for constant-depth read-once formulas ⋮ Fourier bounds and pseudorandom generators for product tests ⋮ Unnamed Item
This page was built for publication: Pseudorandomness for Read-Once Formulas
