Pseudorandom number generation and space complexity
Open Access
- 31 March 1985
- journal article
- Published by Elsevier in Information and Control
- Vol. 64 (1-3) , 43-51
- https://doi.org/10.1016/s0019-9958(85)80043-7
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Computational Complexity of Probabilistic Turing MachinesSIAM Journal on Computing, 1977
- On Time Versus SpaceJournal of the ACM, 1977
- Fast Parallel Matrix Inversion AlgorithmsSIAM Journal on Computing, 1976
- Space-bounded reducibility among combinatorial problemsJournal of Computer and System Sciences, 1975
- Relationships between nondeterministic and deterministic tape complexitiesJournal of Computer and System Sciences, 1970