Pseudorandom generators for space-bounded computation

Abstract

Pseudorandom generators are constructed which convertO(SlogR) truly random bits toR bits that appear random to any algorithm that runs inSPACE(S). In particular, any randomized polynomial time algorithm that runs in spaceS can be simulated using onlyO(Slogn) random bits. An application of these generators is an explicit construction of universal traversal sequences (for arbitrary graphs) of lengthn O(logn).

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.

This is a preview of subscription content, access via your institution.

References

  1. [1]

    R. Aleliunas, R. M. Karp, R. J. Lipton, L. Lovász, andC. Rackoff: Random walks, universal sequences and the complexity of maze problems, in:20 th Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico, 1979, 218–223.

  2. [2]

    M. Ajtai, J. Komlós, andE. Szemerédi: Deterministic simulation in logspace, In:Proceedings of the 19 th Annual ACM Symposium on Theory of Computing, New York City, 1987, 132–141.

  3. [3]

    M. Ajtai andA. Wigderson: Deterministic simulation of probabilistic constant depth circuits, In:26 th Annual Symposium on Foundations of Computer Science, Portland, Oregon, 1985, 11–19.

  4. [4]

    M. Blum andS. Micali: How to generate cryptographically strong sequences of pseudo-random bits,SIAM J. Comp.,13, (1984) 850–864.

    Google Scholar 

  5. [5]

    L. Babai, N. Nisan, andM. Szegedy: Multiparty protocols and logspace-hard pseudorandom sequences, In:Proceedings of the 21 st Annual ACM Symposium on Theory of Computing, Seattle, Washington, 1989, 1–11.

  6. [6]

    B. Chor andO. Goldreich: On the power of two points biased sampling, Manuscript, 1986.

  7. [7]

    L. Carter andM. Wegman: Universal hash functions,J. Comp. and Syst. Sci. 18, (1979) 143–154.

    Google Scholar 

  8. [8]

    A. Cohen andA. Wigderson: Dispersers, deterministic amplification, and weak random sources, In:30 th Annual Symposium on Foundations of Computer Science, Reseach Triangle Park, NC, 1989, 14–19.

  9. [9]

    R. Impagliazzo, L. Levin, andM. Luby: Pseudorandom generation from oneway functions, In:Proceedings of the 21 st Annual ACM Symposium on Theory of Computing, Seattle, Washington, 1989, 12–24.

  10. [10]

    S. Istrail: Polynomial traversing sequences for cycles are constructable, In:Proceedings of the 20 th Annual ACM Symposium on Theory of Computing, 1988, 491–503.

  11. [11]

    R. Impagliazzo andD. Zuckerman: How to recycle random bits, In:30 th Annual Symposium on Foundations of Computer Science, Reseach Triangle Park, NC, 1989, 248–253.

  12. [12]

    R. Karp, N. Pippenger, andM. Sipser: A time-randomness tradeoff, In:AMS Conference on Probabilistic Computational Complexity, 1985.

  13. [13]

    H. Karloff, R. Paturi, andJ. Simon: Universal sequences of lengthn O(logn) for cliques,Inf. Proc. Let. 28, (1988) 241–243.

    Google Scholar 

  14. [14]

    Y. Mansour, N. Nisan, andP. Tiwari: The computational complexity of universal hashing, In:Proceedings of the 22 nd Annual ACM Symposium on Theory of Computing, 1990, 235–243.

  15. [15]

    N. Nisan andA. Wigderson: Hardness vs. randomness, In:29 th Annual Symposium on Foundations of Computer Science, White Plains, New York, 1988, 2–12.

  16. [16]

    M. O. Rabin: Probabilistic algorithm for testing primality,J. of Number Theory 12, (1980) 128–138.

    Google Scholar 

  17. [17]

    M. Santha: On using deterministic functions to reduce randomness in probabilistic algorithms, Manuscript, 1986.

  18. [18]

    M. Sipser: Expanders, randomness or time vs. space,JCSS 36 (1988), 379–383.

    Google Scholar 

  19. [19]

    U. Vazirani: Efficiency considerations in using semi-random sources, In:Proceedings of the 19 th Annual ACM Symposium on Theory of Computing, New York City, 1987, 160–168.

  20. [20]

    A. C. Yao: Theory and applications of trapdoor functions, In:23 rd Annual Symposium on Foundations of Computer Science, 1982, 80–91.

Download references

Author information

Affiliations

Authors

Additional information

This work was done in the Laboratory for Computer Science, MIT, supported by NSF 865727-CCR and ARO DALL03-86-K-017

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Nisan, N. Pseudorandom generators for space-bounded computation. Combinatorica 12, 449–461 (1992). https://doi.org/10.1007/BF01305237

Download citation

AMS subject classification code (1991)

  • 68 Q 15