On read-once vs. multiple access to randomness in logspace (Q1208412): Difference between revisions

@@ Property / Wikidata QID @@
+Q29027264
@@ Property / Wikidata QID: Q29027264 / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Relative to a Random Oracle<i>A</i>, ${\bf P}^A \ne {\bf NP}^A \ne \text{co-}{\bf NP}^A $ with Probability 1
+Normal rank
@@ Property / cites work @@
+Two Applications of Inductive Counting for Complementation Problems
+Normal rank
@@ Property / cites work @@
+Parallel computation for well-endowed rings and space-bounded probabilistic machines
+Normal rank
@@ Property / cites work @@
+Computational Complexity of Probabilistic Turing Machines
+Normal rank
@@ Property / cites work @@
+Nondeterministic Space is Closed under Complementation
+Normal rank
@@ Property / cites work @@
+There is no polynomial deterministic space simulation of probabilistic space with a two-way random-tape generator
+Normal rank
@@ Property / cites work @@
+Space-bounded hierarchies and probabilistic computations
+Normal rank