, Volume 11, Issue 1, pp 63-70

First online:

Pseudorandom bits for constant depth circuits

  • Noam NisanAffiliated withDepartment of Computer Science, Hebrew University of Jerusalem

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


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(2 polylog ). 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