Pages that link to "Item:Q1766819"
From MaRDI portal
The following pages link to The complexity of constructing pseudorandom generators from hard functions (Q1766819):
Displaying 16 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)
- Randomness buys depth for approximate counting (Q483707) (← links)
- On uniformity and circuit lower bounds (Q488049) (← links)
- Hardness amplification within NP against deterministic algorithms (Q619904) (← links)
- Bounded-depth circuits cannot sample good codes (Q692999) (← links)
- Lower bounds on the query complexity of non-uniform and adaptive reductions showing hardness amplification (Q744610) (← links)
- Improved hardness amplification in NP (Q868960) (← links)
- Towards a tight hardness-randomness connection between permanent and arithmetic circuit identity testing (Q1941704) (← links)
- On derandomizing Yao's weak-to-strong OWF construction (Q2697871) (← links)
- Uniform derandomization from pathetic lower bounds (Q2941601) (← links)
- Lower Bounds on the Query Complexity of Non-uniform and Adaptive Reductions Showing Hardness Amplification (Q3088109) (← links)
- (Q3304157) (← links)
- (Q5009532) (← links)
- Quantified Derandomization: How to Find Water in the Ocean (Q5060673) (← links)
- (Q5092470) (← links)
