Pages that link to "Item:Q2913799"
From MaRDI portal
The following pages link to On circuit lower bounds from derandomization (Q2913799):
Displaying 18 items.
- Pseudorandom generators for combinatorial checkerboards (Q395607) (← links)
- Pseudorandom generators, typically-correct derandomization, and circuit lower bounds (Q430845) (← links)
- A Wronskian approach to the real \(\tau\)-conjecture (Q480686) (← links)
- On uniformity and circuit lower bounds (Q488049) (← links)
- Deterministic polynomial identity tests for multilinear bounded-read formulae (Q901932) (← links)
- Hardness hypotheses, derandomization, and circuit complexity (Q937197) (← links)
- Circuit size relative to pseudorandom oracles (Q1208410) (← links)
- Nondeterministic circuit lower bounds from mildly derandomizing Arthur-Merlin games (Q2012178) (← links)
- Improved bounds for quantified derandomization of constant-depth circuits and polynomials (Q2311548) (← links)
- A zero-one law for RP and derandomization of AM if NP is not small (Q2389331) (← links)
- On derandomizing Yao's weak-to-strong OWF construction (Q2697871) (← links)
- Jacobian hits circuits: hitting sets, lower bounds for depth-\(D\) occur-\(k\) formulas and depth-3 transcendence degree-\(k\) circuits (Q2817792) (← links)
- Uniform derandomization from pathetic lower bounds (Q2941601) (← links)
- Uniform Derandomization from Pathetic Lower Bounds (Q3588422) (← links)
- (Q4526985) (← links)
- Mathematical Foundations of Computer Science 2004 (Q5311109) (← links)
- (Q5875775) (← links)
- Derandomizing polynomial identity tests means proving circuit lower bounds (Q5916126) (← links)