[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science (1988)
White Plains, NY, USA
Oct. 24, 1988 to Oct. 26, 1988
N. Nisan , Div. of Comput. Sci., California Univ., Berkeley, CA, USA
A simple construction for a pseudorandom bit generator is presented. It stretches a short string of truly random bits into a long string that looks random to any algorithm from a complexity class C (e.g. P, NC, PSPACE, etc.), using an arbitrary function that is hard for C. This generator reveals an equivalence between the problems of proving lower bounds and the problem of generating good pseudorandom sequences. Combining this construction with other arguments, a number of consequences are obtained.
lower bounds, hardness, randomness, pseudorandom bit generator, complexity class C, arbitrary function
A. Wigderson and N. Nisan, "Hardness vs. randomness," [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science(FOCS), White Plains, NY, USA, 1988, pp. 2-11.