TY - GEN

T1 - Pseudorandom generators for space-bounded computation

AU - Nisan, Noam

PY - 1990

Y1 - 1990

N2 - Pseudorandom generators are constructed which convert O(S log R) truly random bits to R bits that appear random to any algorithm that runs in SPACE(S). In particular, any randomized polynomial time algorithm that runs in space S can be simulated using only O(S log n) random bits. An application of these generators is an explicit construction of universal traversal sequences (for arbitrary graphs) of length nO(log n). The generators constructed are technically stronger than just appearing random to spacebounded machines, and have several other applications. In particular, applications are given for 'deterministic amplification' (i.e. reducing the probability of error of randomized algorithms), as well as generalizations of it.

AB - Pseudorandom generators are constructed which convert O(S log R) truly random bits to R bits that appear random to any algorithm that runs in SPACE(S). In particular, any randomized polynomial time algorithm that runs in space S can be simulated using only O(S log n) random bits. An application of these generators is an explicit construction of universal traversal sequences (for arbitrary graphs) of length nO(log n). The generators constructed are technically stronger than just appearing random to spacebounded machines, and have several other applications. In particular, applications are given for 'deterministic amplification' (i.e. reducing the probability of error of randomized algorithms), as well as generalizations of it.

UR - http://www.scopus.com/inward/record.url?scp=0025152619&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0025152619

SN - 0897913612

T3 - Proc 22nd Annu ACM Symp Theory Comput

SP - 204

EP - 212

BT - Proc 22nd Annu ACM Symp Theory Comput

PB - Publ by ACM

T2 - Proceedings of the 22nd Annual ACM Symposium on Theory of Computing

Y2 - 14 May 1990 through 16 May 1990

ER -