Pseudorandom Generators for Read-Once ACC^0

Dmitry Gavinsky, Shachar Lovett, Srikanth Srinivasan
2012 2012 IEEE 27th Conference on Computational Complexity  
We consider the problem of constructing pseudorandom generators for read-once circuits. We give an explicit construction of a pseudorandom generator for the class of read-once constant depth circuits with unbounded fan-in AND, OR, NOT and generalized modulo m gates, where m is an arbitrary fixed constant. The seed length of our generator is poly-logarithmic in the number of variables and the error.
doi:10.1109/ccc.2012.37 dblp:conf/coco/GavinskyLS12 fatcat:67a6f2di4ncybh3sxhzamp57gy