The following pages link to (Q4440439):
Displaying 11 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)
- Weak derandomization of weak algorithms: explicit versions of Yao's lemma (Q451107) (← links)
- On uniformity and circuit lower bounds (Q488049) (← links)
- On the Average-Case Complexity of Property Testing (Q3088183) (← links)
- Fine-grained derandomization: from problem-centric to resource-centric complexity (Q5002697) (← links)
- Typically-correct derandomization for small time and space (Q5091759) (← links)
- Worst-Case to Average-Case Reductions for Subclasses of P (Q5098780) (← links)
- (Nondeterministic) hardness vs. non-malleability (Q6097260) (← links)
- Nearly optimal pseudorandomness from hardness (Q6551259) (← links)
- Non-malleable codes with optimal rate for poly-size circuits (Q6637518) (← links)
