Pages that link to "Item:Q430845"

The following pages link to Pseudorandom generators, typically-correct derandomization, and circuit lower bounds (Q430845):

Displaying 19 items.

• Deterministic polynomial identity tests for multilinear bounded-read formulae (Q901932) (← links)
• Circuit size relative to pseudorandom oracles (Q1208410) (← links)
• Pseudorandom functions in \(\text{TC}^0\) and cryptographic limitations to proving lower bounds (Q1405738) (← links)
• Nondeterministic circuit lower bounds from mildly derandomizing Arthur-Merlin games (Q2012178) (← links)
• Pseudorandom generators hard for \(k\)-DNF resolution and polynomial calculus resolution (Q2255289) (← links)
• Proving that \(\mathrm{prBPP}=\mathrm{prP}\) is as hard as proving that ``almost NP'' is not contained in P/poly (Q2328311) (← links)
• (Q2762792) (← links)
• Pseudorandom Generators and Typically-Correct Derandomization (Q3638904) (← links)
• Fine-grained derandomization: from problem-centric to resource-centric complexity (Q5002697) (← links)
• Typically-correct derandomization for small time and space (Q5091759) (← links)
• Targeted Pseudorandom Generators, Simulation Advice Generators, and Derandomizing Logspace (Q5856147) (← links)
• Improved Extractors for Recognizable and Algebraic Sources (Q5875532) (← links)
• (Q5875775) (← links)
• On pseudorandomness and resource-bounded measure (Q5941070) (← links)
• (Q6054746) (← links)
• The exact complexity of pseudorandom functions and the black-box natural proof barrier for bootstrapping results in computational complexity (Q6083551) (← links)
• Robustness of average-case meta-complexity via pseudorandomness (Q6083613) (← links)
• (Nondeterministic) hardness vs. non-malleability (Q6097260) (← links)
• Generation of all randomizations using circuits (Q6173732) (← links)