On read-once vs. multiple access to randomness in logspace
type: Item
instance of: scholarly article
title: On read-once vs. multiple access to randomness in logspace
zbMATH Open document ID: 0774.68037
DOI: 10.1016/0304-3975(93)90258-U
author: Noam Nisan
published in: Theoretical Computer Science
publication date: 1993-05-16T00:00:00Z
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 68Q15
zbMATH DE Number: 166424
zbMATH Keywords: randomness
zbMATH Keywords: randomized space-bounded computation
zbMATH Keywords: multiple access
zbMATH Keywords: read- once access
zbMATH Keywords: zero error
zbMATH Keywords: randomized logspace machine
zbMATH Keywords: two-sided error
Wikidata QID: Q29027264
MaRDI profile type: Publication
cites work: Relative to a Random OracleA, ${\bf P}^A \ne {\bf NP}^A \ne \text{co-}{\bf NP}^A $ with Probability 1
cites work: Two Applications of Inductive Counting for Complementation Problems
cites work: Parallel computation for well-endowed rings and space-bounded probabilistic machines
cites work: Computational Complexity of Probabilistic Turing Machines
cites work: Nondeterministic Space is Closed under Complementation
cites work: There is no polynomial deterministic space simulation of probabilistic space with a two-way random-tape generator
cites work: Space-bounded hierarchies and probabilistic computations
full work available at URL: 0304-3975(93)90258-u
OpenAlex ID: W1981030589
DBLP publication ID: journals/tcs/Nisan93
description: scientific article; zbMATH DE number 166424