, Volume 11, Issue 1, pp 63–70

Pseudorandom bits for constant depth circuits

  • Noam Nisan

DOI: 10.1007/BF01375474

Cite this article as:
Nisan, N. Combinatorica (1991) 11: 63. doi:10.1007/BF01375474


For every integerd we explicitly construct a family of functions (pseudo-random bit generators) that convert a polylogarithmic number of truly random bits ton bits that appear random to any family of circuits of polynomial size and depthd. The functions we construct are computable by a uniform family of circuits of polynomial size and constant depth. This allows us to simulate randomized constant depth polynomial size circuits inDSPACE(polylog) and inDTIME(2polylog). As a corollary we show that the complexity class AM is equal to the class of languages recognizable in NP with a random oracle. Our technique may be applied in order to get pseudo random generators for other complexity classes as well; a further paper [16] explores these issues.

AMS subject classification (1980)

68 C 25 

Copyright information

© Akadémiai Kiadó 1991

Authors and Affiliations

  • Noam Nisan
    • 1
  1. 1.Department of Computer ScienceHebrew University of JerusalemIsrael

Personalised recommendations