Pseudo-random generators for all hardnesses (Q5917585): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+A new general derandomization method
@@ Property / cites work: A new general derandomization method / rank @@
+Normal rank
@@ Property / cites work @@
+Weak Random Sources, Hitting Sets, and BPP Simulations
+Normal rank
@@ Property / cites work @@
+\(BPP\) has subexponential time simulations unless \(EXPTIME\) has publishable proofs
+Normal rank
@@ Property / cites work @@
+How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
+Normal rank
@@ Property / cites work @@
+Simplified Derandomization of BPP Using a Hitting Set Generator
+Normal rank
@@ Property / cites work @@
+List decoding algorithms for certain concatenated codes
+Normal rank
@@ Property / cites work @@
+Q4252738
@@ Property / cites work: Q4252738 / rank @@
+Normal rank
@@ Property / cites work @@
+In search of an easy witness: Exponential time vs. probabilistic polynomial time.
+Normal rank
@@ Property / cites work @@
+Extractors and pseudo-random generators with optimal seed length
+Normal rank
@@ Property / cites work @@
+Q4526985
@@ Property / cites work: Q4526985 / rank @@
+Normal rank
@@ Property / cites work @@
+Easiness assumptions and hardness tests: Trading time for zero error
+Normal rank
@@ Property / cites work @@
+Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses
+Normal rank
@@ Property / cites work @@
+Q5287502
@@ Property / cites work: Q5287502 / rank @@
+Normal rank
@@ Property / cites work @@
+Derandomizing Arthur-Merlin games under uniform assumptions
+Normal rank
@@ Property / cites work @@
+Derandomizing Arthur-Merlin games using hitting sets
+Normal rank
@@ Property / cites work @@
+Hardness vs randomness
@@ Property / cites work: Hardness vs randomness / rank @@
+Normal rank
@@ Property / cites work @@
+Decoding of Reed Solomon codes beyond the error-correction bound
+Normal rank
@@ Property / cites work @@
+Pseudorandom generators without the XOR lemma
@@ Property / cites work: Pseudorandom generators without the XOR lemma / rank @@
+Normal rank
@@ Property / cites work @@
+Extractors from Reed-Muller codes
@@ Property / cites work: Extractors from Reed-Muller codes / rank @@
+Normal rank
@@ Property / cites work @@
+Extractors and pseudorandom generators
@@ Property / cites work: Extractors and pseudorandom generators / rank @@
+Normal rank