On read once vs. multiple access to randomness in logspace

Theoretical Computer Science

Volumn 107, Issue 1, 1993, Pages 135-144

  Nisan, Noam ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 38249006948     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(93)90258-U     Document Type: Article

References (12)

1. Two theorems on random polynomial time
2. Multiparty protocols and logspace-hard pseudorandom sequences
3. a with probability 1
4. Two applications of inductive counting for complementation problems
5. Parallel computation for well-endowed rings and space-bounded probabilistic machines
6. Computational complexity of probabilistic turing machines
7. On similarity and duality of computation
8. Nondeterministic space is closed under complementation
9. There is no polynomial deterministic space simulation of probabilistic space with two-way random-tape generator
10. Pseudorandom generators for space-bounded computation
11. Hardness vs. randomness
12. Space-bounded hierarchies and probabilistic computation