2012 IEEE 27th Conference on Computational Complexity (2012)
June 26, 2012 to June 29, 2012
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CCC.2012.37
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.
Random restrictions, Pseudorandom generators, Derandomization
"Pseudorandom Generators for Read-Once ACC^0", 2012 IEEE 27th Conference on Computational Complexity, vol. 00, no. , pp. 287-297, 2012, doi:10.1109/CCC.2012.37