Pages that link to "Item:Q5917585"
From MaRDI portal
The following pages link to Pseudo-random generators for all hardnesses (Q5917585):
Displaying 24 items.
- Pseudorandom generators for combinatorial checkerboards (Q395607) (← links)
- On derandomization and average-case complexity of monotone functions (Q428873) (← links)
- Derandomizing Arthur-Merlin games and approximate counting implies exponential-size lower bounds (Q645124) (← links)
- \(\mathrm{AC}^{0}\circ \mathrm{MOD}_{2}\) lower bounds for the Boolean inner product (Q1671999) (← links)
- Fourier concentration from shrinkage (Q2012185) (← links)
- A brief and understandable guide to pseudo-random number generators and specific models for security (Q2137825) (← links)
- Reconstructive dispersers and hitting set generators (Q2391190) (← links)
- Natural proofs versus derandomization (Q2805512) (← links)
- Jacobian hits circuits: hitting sets, lower bounds for depth-\(D\) occur-\(k\) formulas and depth-3 transcendence degree-\(k\) circuits (Q2817792) (← links)
- Uniform derandomization from pathetic lower bounds (Q2941601) (← links)
- ON THE HARDNESS AGAINST CONSTANT-DEPTH LINEAR-SIZE CIRCUITS (Q3084685) (← links)
- In a World of P=BPP (Q3088186) (← links)
- Pseudo-Derandomizing Learning and Approximation (Q5009554) (← links)
- Quantified Derandomization: How to Find Water in the Ocean (Q5060673) (← links)
- Derandomization from Algebraic Hardness (Q5073523) (← links)
- Randomness and Intractability in Kolmogorov Complexity (Q5091181) (← links)
- Relations and equivalences between circuit lower bounds and karp-lipton theorems (Q5091782) (← links)
- (Q5092488) (← links)
- (Q5121895) (← links)
- Circuit Lower Bounds for Nondeterministic Quasi-polytime from a New Easy Witness Lemma (Q5130843) (← links)
- Targeted Pseudorandom Generators, Simulation Advice Generators, and Derandomizing Logspace (Q5856147) (← links)
- The power of natural properties as oracles (Q6116834) (← links)
- Generation of all randomizations using circuits (Q6173732) (← links)
- Nearly optimal pseudorandomness from hardness (Q6551259) (← links)
