TY - GEN
T1 - DETERMINISTIC SIMULATION OF PROBABILISTIC CONSTANT DEPTH CIRCUITS.
AU - Ajtai, Miklos
AU - Wigderson, Avi
PY - 1985
Y1 - 1985
N2 - The authors explicitly construct, for every integer n and epsilon less than 0, a family of functions (pseudorandom bit generators) with the following property: for a random seed, the pseudorandom output 'looks random' to any polynomial-size, constant-depth, unbounded fan-in circuit. Moreover, the functions themselves can be computed by uniform, polynomial-size, constant-depth circuits.
AB - The authors explicitly construct, for every integer n and epsilon less than 0, a family of functions (pseudorandom bit generators) with the following property: for a random seed, the pseudorandom output 'looks random' to any polynomial-size, constant-depth, unbounded fan-in circuit. Moreover, the functions themselves can be computed by uniform, polynomial-size, constant-depth circuits.
UR - http://www.scopus.com/inward/record.url?scp=0022186361&partnerID=8YFLogxK
U2 - 10.1109/sfcs.1985.19
DO - 10.1109/sfcs.1985.19
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:0022186361
SN - 0818606444
SN - 9780818606441
T3 - Annual Symposium on Foundations of Computer Science (Proceedings)
SP - 11
EP - 19
BT - Annual Symposium on Foundations of Computer Science (Proceedings)
PB - IEEE
ER -