Pages that link to "Item:Q3638904"
From MaRDI portal
The following pages link to Pseudorandom Generators and Typically-Correct Derandomization (Q3638904):
Displaying 18 items.
- Pseudorandom generators for combinatorial checkerboards (Q395607) (← links)
- Pseudorandom generators, typically-correct derandomization, and circuit lower bounds (Q430845) (← links)
- Weak derandomization of weak algorithms: explicit versions of Yao's lemma (Q451107) (← links)
- Derandomizing Arthur-Merlin games and approximate counting implies exponential-size lower bounds (Q645124) (← links)
- An asymptotically perfect pseudorandom generator (Q1864085) (← links)
- Cryptographic pseudorandom generators can make cryptosystems problematic (Q2061967) (← links)
- Pseudorandom generators and the frequency of simplicity (Q2563546) (← links)
- (Q2963793) (← links)
- An Introduction to Randomness Extractors (Q3012907) (← links)
- (Q3974094) (← links)
- (Q5077146) (← links)
- (Q5121889) (← links)
- Dimension, Pseudorandomness and Extraction of Pseudorandomness (Q5275369) (← links)
- (Q5748796) (← links)
- Efficient Pseudorandom Generators Based on the DDH Assumption (Q5756548) (← links)
- Targeted Pseudorandom Generators, Simulation Advice Generators, and Derandomizing Logspace (Q5856147) (← links)
- Pseudo-random generators for all hardnesses (Q5917585) (← links)
- Derandomizing Knockoffs (Q6165283) (← links)