Advertisement

Pseudorandom number generation and space complexity

  • Merrick Furst
  • Richard Lipton
  • Larry Stockmeyer
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 158)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    L. Adleman, Two theorems on random polynomial time, Proc. 19th IEEE Symp. on Foundations of Computer Science (1978), 75–83.Google Scholar
  2. 2.
    A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.Google Scholar
  3. 3.
    M. Blum and S. Micali, How to generate cryptographically strong sequences of pseudo random bits, Proc. 23rd IEEE Symp. on Foundations of Computer Science (1982), 112–117.Google Scholar
  4. 4.
    L. Csanky, Fast parallel matrix inversion algorithms, SIAM J. Comput. 5 (1976), 618–623.Google Scholar
  5. 5.
    J. Gill, Computational complexity of probabilistic Turing machines, SIAM J. Comput. 6 (1977), 675–695.CrossRefGoogle Scholar
  6. 6.
    J. Hopcroft, W. Paul, and L. Valiant, On time versus space, J.ACM 24 (1977), 332–337.CrossRefGoogle Scholar
  7. 7.
    J. E. Hopcroft and J. D. Ullman, Introduction to Automata Theory, Languages and Computation, Addison-Wesley, Reading, MA, 1979.Google Scholar
  8. 8.
    N. Jones, Space-bounded reducibility among combinatorial problems, J. Comput. Sys. Sci. 11 (1975), 68–85.Google Scholar
  9. 9.
    J. E. Savage, The Complexity of Computing, John Wiley and Sons, New York, 1976.Google Scholar
  10. 10.
    W. J. Savitch, Relationships between nondeterministic and deterministic tape complexities, J. Comput. Sys. Sci. 4 (1970), 177–192.Google Scholar
  11. 11.
    L. J. Stockmeyer and A. R. Meyer, Word problems requiring exponential time, Proc. 5th ACM Symp. on Theory of Computing (1973), 1–9.Google Scholar
  12. 12.
    A. Yao, Theory and applications of trapdoor functions, Proc. 23rd IEEE Symp. on Foundations of Computer Science (1982), 80–91.Google Scholar
  13. 13.
    A. Yao, personal communication.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1983

Authors and Affiliations

  • Merrick Furst
    • 1
  • Richard Lipton
    • 2
  • Larry Stockmeyer
    • 3
  1. 1.Department of Computer ScienceCarnegie-Mellon UniversityPittsburgh
  2. 2.Department of Electrical Engineering and Computer SciencePrinceton UniversityPrinceton
  3. 3.IBM Research LabSan Jose

Personalised recommendations