Pseudorandom generators for space-bounded computation
- 1 December 1992
- journal article
- Published by Springer Nature in Combinatorica
- Vol. 12 (4) , 449-461
- https://doi.org/10.1007/bf01305237
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Pseudo-random generation from one-way functionsPublished by Association for Computing Machinery (ACM) ,1989
- Multiparty protocols and logspace-hard pseudorandom sequencesPublished by Association for Computing Machinery (ACM) ,1989
- Dispersers, deterministic amplification, and weak random sourcesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- How to recycle random bitsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- Polynomial universal traversing sequences for cycles are constructiblePublished by Association for Computing Machinery (ACM) ,1988
- Deterministic simulation in LOGSPACEPublished by Association for Computing Machinery (ACM) ,1987
- Deterministic simulation of probabilistic constant depth circuitsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- How to Generate Cryptographically Strong Sequences of Pseudorandom BitsSIAM Journal on Computing, 1984
- Random walks, universal traversal sequences, and the complexity of maze problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1979
- Universal classes of hash functionsJournal of Computer and System Sciences, 1979