Pages that link to "Item:Q451107"
From MaRDI portal
The following pages link to Weak derandomization of weak algorithms: explicit versions of Yao's lemma (Q451107):
Displaying 10 items.
- Incompressible functions, relative-error extractors, and the power of nondeterministic reductions (Q301524) (← links)
- Pseudorandom generators, typically-correct derandomization, and circuit lower bounds (Q430845) (← links)
- Exposure-resilient extractors and the derandomization of probabilistic sublinear time (Q937199) (← links)
- On derandomizing Yao's weak-to-strong OWF construction (Q2697871) (← links)
- An Introduction to Randomness Extractors (Q3012907) (← links)
- Fine-grained derandomization: from problem-centric to resource-centric complexity (Q5002697) (← links)
- Typically-correct derandomization for small time and space (Q5091759) (← links)
- Amplification and Derandomization without Slowdown (Q5129234) (← links)
- Improved Extractors for Recognizable and Algebraic Sources (Q5875532) (← links)
- (Nondeterministic) hardness vs. non-malleability (Q6097260) (← links)