Pages that link to "Item:Q1766819"

The following pages link to The complexity of constructing pseudorandom generators from hard functions (Q1766819):

Displaying 30 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)
• On linear-size pseudorandom generators and hardcore functions (Q744085) (← 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)
• Pseudorandom generators hard for \(k\)-DNF resolution and polynomial calculus resolution (Q2255289) (← links)
• On derandomizing Yao's weak-to-strong OWF construction (Q2697871) (← links)
• (Q2762792) (← links)
• Uniform derandomization from pathetic lower bounds (Q2941601) (← links)
• On the Complexity of Non-adaptively Increasing the Stretch of Pseudorandom Generators (Q3000561) (← links)
• Lower Bounds on the Query Complexity of Non-uniform and Adaptive Reductions Showing Hardness Amplification (Q3088109) (← links)
• Computational Randomness from Generalized Hardcore Sets (Q3088271) (← links)
• ON THE PROOF COMPLEXITY OF THE NISAN–WIGDERSON GENERATOR BASED ON A HARD <font>NP</font> ∩ <font>coNP</font> FUNCTION (Q3094358) (← links)
• Lower bounds on black-box reductions of hitting to density estimation (Q3304157) (← links)
• Efficient Pseudorandom Generators from Exponentially Hard One-Way Functions (Q3591440) (← links)
• Incompressible functions, relative-error extractors, and the power of nondeterministic reductions (extended abstract) (Q4601848) (← links)
• (Q5009532) (← links)
• Quantified Derandomization: How to Find Water in the Ocean (Q5060673) (← links)
• (Q5092470) (← links)
• Theory of Cryptography (Q5898368) (← links)
• Theory of Cryptography (Q5898369) (← links)
• Pseudo-random generators for all hardnesses (Q5917585) (← links)
• (Q6054746) (← links)
• The exact complexity of pseudorandom functions and the black-box natural proof barrier for bootstrapping results in computational complexity (Q6083551) (← links)
• Constructive separations and their consequences (Q6566463) (← links)