Skip to main content
SpringerLink
Log in
Book cover

International Conference on Fundamentals of Computation Theory

FCT 1983: Foundations of Computation Theory pp 171–176Cite as

Pseudorandom number generation and space complexity

  • Conference paper
  • First Online:

  • 124 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 158))

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. L. Adleman, Two theorems on random polynomial time, Proc. 19th IEEE Symp. on Foundations of Computer Science (1978), 75–83.

    Google Scholar 

  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. 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. L. Csanky, Fast parallel matrix inversion algorithms, SIAM J. Comput. 5 (1976), 618–623.

    Google Scholar 

  5. J. Gill, Computational complexity of probabilistic Turing machines, SIAM J. Comput. 6 (1977), 675–695.

    Article  Google Scholar 

  6. J. Hopcroft, W. Paul, and L. Valiant, On time versus space, J.ACM 24 (1977), 332–337.

    Article  Google Scholar 

  7. J. E. Hopcroft and J. D. Ullman, Introduction to Automata Theory, Languages and Computation, Addison-Wesley, Reading, MA, 1979.

    Google Scholar 

  8. N. Jones, Space-bounded reducibility among combinatorial problems, J. Comput. Sys. Sci. 11 (1975), 68–85.

    Google Scholar 

  9. J. E. Savage, The Complexity of Computing, John Wiley and Sons, New York, 1976.

    Google Scholar 

  10. W. J. Savitch, Relationships between nondeterministic and deterministic tape complexities, J. Comput. Sys. Sci. 4 (1970), 177–192.

    Google Scholar 

  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. A. Yao, Theory and applications of trapdoor functions, Proc. 23rd IEEE Symp. on Foundations of Computer Science (1982), 80–91.

    Google Scholar 

  13. A. Yao, personal communication.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Carnegie-Mellon University, 15213, Pittsburgh, PA

    Merrick Furst

  2. Department of Electrical Engineering and Computer Science, Princeton University, 08544, Princeton, NJ

    Richard Lipton

  3. IBM Research Lab, 95193, San Jose, CA

    Larry Stockmeyer

Authors
  1. Merrick Furst
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Richard Lipton
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Larry Stockmeyer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Marek Karpinski

Rights and permissions

Reprints and permissions

Copyright information

© 1983 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Furst, M., Lipton, R., Stockmeyer, L. (1983). Pseudorandom number generation and space complexity. In: Karpinski, M. (eds) Foundations of Computation Theory. FCT 1983. Lecture Notes in Computer Science, vol 158. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-12689-9_102

Download citation

  • DOI: https://doi.org/10.1007/3-540-12689-9_102

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-12689-8

  • Online ISBN: 978-3-540-38682-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation