The following pages link to (Q3152808):
Displayed 5 items.
- Weak derandomization of weak algorithms: explicit versions of Yao's lemma (Q451107) (← links)
- Random oracles and non-uniformity (Q1648794) (← links)
- In search of an easy witness: Exponential time vs. probabilistic polynomial time. (Q1872732) (← links)
- How strong is Nisan's pseudo-random generator? (Q1944139) (← links)
- Reconstructive dispersers and hitting set generators (Q2391190) (← links)