In a World of P=BPP (Q3088186): Difference between revisions

@@ Property / cites work @@
+Derandomizing Arthur-Merlin games and approximate counting implies exponential-size lower bounds
+Normal rank
@@ Property / cites work @@
+How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
+Normal rank
@@ Property / cites work @@
+On the power of two-point based sampling
@@ Property / cites work: On the power of two-point based sampling / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of promise problems with applications to public-key cryptography
+Normal rank
@@ Property / cites work @@
+A proof of alon's second eigenvalue conjecture
@@ Property / cites work: A proof of alon's second eigenvalue conjecture / rank @@
+Normal rank
@@ Property / cites work @@
+Foundations of Cryptography
@@ Property / cites work: Foundations of Cryptography / rank @@
+Normal rank
@@ Property / cites work @@
+Computational Complexity
@@ Property / cites work: Computational Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Probabilistic encryption
@@ Property / cites work: Probabilistic encryption / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity Measures for Public-Key Cryptosystems
@@ Property / cites work: Complexity Measures for Public-Key Cryptosystems / rank @@
+Normal rank
@@ Property / cites work @@
+Q3002852
@@ Property / cites work: Q3002852 / rank @@
+Normal rank
@@ Property / cites work @@
+On the difference between consecutive primes
@@ Property / cites work: On the difference between consecutive primes / rank @@
+Normal rank
@@ Property / cites work @@
+In search of an easy witness: Exponential time vs. probabilistic polynomial time.
+Normal rank
@@ Property / cites work @@
+Q4526985
@@ Property / cites work: Q4526985 / rank @@
+Normal rank
@@ Property / cites work @@
+Randomness vs time: Derandomization under a uniform assumption
+Normal rank
@@ Property / cites work @@
+Random generation of combinatorial structures from a uniform distribution
+Normal rank
@@ Property / cites work @@
+Derandomizing polynomial identity tests means proving circuit lower bounds
+Normal rank
@@ Property / cites work @@
+Hardness vs randomness
@@ Property / cites work: Hardness vs randomness / rank @@
+Normal rank
@@ Property / cites work @@
+Pseudorandom walks on regular digraphs and the RL vs. L problem
+Normal rank
@@ Property / cites work @@
+Low-End Uniform Hardness versus Randomness Tradeoffs for AM
+Normal rank
@@ Property / cites work @@
+Pseudorandomness and average-case complexity via uniform reductions
+Normal rank
@@ Property / cites work @@
+Pseudo-random generators for all hardnesses
@@ Property / cites work: Pseudo-random generators for all hardnesses / rank @@
+Normal rank
@@ Property / cites work @@
+An Unconditional Study of Computational Zero Knowledge
+Normal rank