Pseudorandom generators for space-bounded computation (Q1204523): Difference between revisions

@@ Property / cites work @@
+How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
+Normal rank
@@ Property / cites work @@
+Universal classes of hash functions
@@ Property / cites work: Universal classes of hash functions / rank @@
+Normal rank
@@ Property / cites work @@
+Universal traversal sequences of length \(n^{0(\log \,n)}\) for cliques
+Normal rank
@@ Property / cites work @@
+The computational complexity of universal hashing
@@ Property / cites work: The computational complexity of universal hashing / rank @@
+Normal rank
@@ Property / cites work @@
+Probabilistic algorithm for testing primality
@@ Property / cites work: Probabilistic algorithm for testing primality / rank @@
+Normal rank
@@ Property / cites work @@
+On using deterministic functions to reduce randomness in probabilistic algorithms
+Normal rank
@@ Property / cites work @@
+Expanders, randomness, or time versus space
@@ Property / cites work: Expanders, randomness, or time versus space / rank @@
+Normal rank