Randomness vs time: Derandomization under a uniform assumption (Q1604214): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1006/jcss.2001.1780
+Normal rank
@@ Property / OpenAlex ID @@
+W2062855793
@@ Property / OpenAlex ID: W2062855793 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4818849
@@ Property / cites work: Q4818849 / rank @@
+Normal rank
@@ Property / cites work @@
+Worst-case hardness suffices for derandomization: a new method for hardness-randomness trade-offs
+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 @@
+Oracles and queries that are sufficient for exact learning
+Normal rank
@@ Property / cites work @@
+Non-deterministic exponential time has two-prover interactive protocols
+Normal rank
@@ Property / cites work @@
+\(BPP\) has subexponential time simulations unless \(EXPTIME\) has publishable proofs
+Normal rank
@@ Property / cites work @@
+Q3359734
@@ Property / cites work: Q3359734 / rank @@
+Normal rank
@@ Property / cites work @@
+How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
+Normal rank
@@ Property / cites work @@
+Hardness and hierarchy theorems for probabilistic quasi-polynomial time
+Normal rank
@@ Property / cites work @@
+On the Existence of Pseudorandom Generators
@@ Property / cites work: On the Existence of Pseudorandom Generators / rank @@
+Normal rank
@@ Property / cites work @@
+On Yao’s XOR-Lemma
@@ Property / cites work: On Yao’s XOR-Lemma / rank @@
+Normal rank
@@ Property / cites work @@
+A Pseudorandom Generator from any One-way Function
+Normal rank
@@ Property / cites work @@
+Q4252738
@@ Property / cites work: Q4252738 / rank @@
+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 @@
+Turing machines that take advice
@@ Property / cites work: Turing machines that take advice / rank @@
+Normal rank
@@ Property / cites work @@
+One way functions and pseudorandom generators
@@ Property / cites work: One way functions and pseudorandom generators / rank @@
+Normal rank
@@ Property / cites work @@
+Q4871218
@@ Property / cites work: Q4871218 / rank @@
+Normal rank
@@ Property / cites work @@
+Average Case Complete Problems
@@ Property / cites work: Average Case Complete Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q3210157
@@ Property / cites work: Q3210157 / rank @@
+Normal rank
@@ Property / cites work @@
+Pseudorandom bits for constant depth circuits
@@ Property / cites work: Pseudorandom bits for constant depth circuits / rank @@
+Normal rank
@@ Property / cites work @@
+Hardness vs randomness
@@ Property / cites work: Hardness vs randomness / rank @@
+Normal rank
@@ Property / cites work @@
+Natural proofs
@@ Property / cites work: Natural proofs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3912481
@@ Property / cites work: Q3912481 / rank @@
+Normal rank
@@ Property / cites work @@
+PP is as Hard as the Polynomial-Time Hierarchy
@@ Property / cites work: PP is as Hard as the Polynomial-Time Hierarchy / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1604214