How strong is Nisan's pseudo-random generator? (Q1944139): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ipl.2011.04.013
+Normal rank
@@ Property / OpenAlex ID @@
+W148806319
@@ Property / OpenAlex ID: W148806319 / rank @@
+Normal rank
@@ Property / cites work @@
+Computational Complexity
@@ Property / cites work: Computational Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Fast parallel matrix and GCD computations
@@ Property / cites work: Fast parallel matrix and GCD computations / rank @@
+Normal rank
@@ Property / cites work @@
+Pseudorandomness for network algorithms
@@ Property / cites work: Pseudorandomness for network algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Q3152808
@@ Property / cites work: Q3152808 / rank @@
+Normal rank
@@ Property / cites work @@
+A fast parallel algorithm to compute the rank of a matrix over an arbitrary field
+Normal rank
@@ Property / cites work @@
+Pseudorandom generators for space-bounded computation
+Normal rank
@@ Property / cites work @@
+On read-once vs. multiple access to randomness in logspace
+Normal rank