The following pages link to (Q4252738):
Displaying 37 items.
- A counterexample to the chain rule for conditional HILL entropy (Q332268) (← links)
- Derandomized parallel repetition theorems for free games (Q371195) (← links)
- Pseudorandom generators, typically-correct derandomization, and circuit lower bounds (Q430845) (← links)
- A complete characterization of statistical query learning with applications to evolvability (Q439989) (← links)
- Complexity of hard-core set proofs (Q451110) (← links)
- Hardness amplification within NP against deterministic algorithms (Q619904) (← links)
- Improved direct product theorems for randomized query complexity (Q693002) (← links)
- Collapsing and separating completeness notions under average-case and worst-case hypotheses (Q693053) (← 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)
- Query complexity in errorless hardness amplification (Q901934) (← links)
- Randomness vs time: Derandomization under a uniform assumption (Q1604214) (← links)
- The value of help bits in randomized and average-case complexity (Q2012180) (← links)
- Amplifying the security of functional encryption, unconditionally (Q2096505) (← links)
- A note on the relation between XOR and selective XOR lemmas (Q2203599) (← links)
- Simulation theorems via pseudo-random properties (Q2281252) (← links)
- On derandomized composition of Boolean functions (Q2281253) (← links)
- The inverse Shapley value problem (Q2411521) (← links)
- On derandomizing Yao's weak-to-strong OWF construction (Q2697871) (← links)
- Advice Lower Bounds for the Dense Model Theorem (Q2828224) (← links)
- Nonuniform Indistinguishability and Unpredictability Hardcore Lemmas: New Proofs and Applications to Pseudoentropy (Q2947526) (← links)
- A PCP Characterization of AM (Q3012834) (← links)
- Lower Bounds on the Query Complexity of Non-uniform and Adaptive Reductions Showing Hardness Amplification (Q3088109) (← links)
- Query Complexity in Errorless Hardness Amplification (Q3088136) (← links)
- On Yao’s XOR-Lemma (Q3088189) (← links)
- Computational Randomness from Generalized Hardcore Sets (Q3088271) (← links)
- Simulating Auxiliary Inputs, Revisited (Q3179356) (← links)
- Nearly Optimal Solutions for the Chow Parameters Problem and Low-Weight Approximation of Halfspaces (Q3189646) (← links)
- (Q3191596) (← links)
- A Hardcore Lemma for Computational Indistinguishability: Security Amplification for Arbitrarily Weak PRGs with Optimal Stretch (Q3408197) (← links)
- (Q5009532) (← links)
- (Q5092470) (← links)
- Hardness amplification within NP (Q5917544) (← links)
- Pseudo-random generators for all hardnesses (Q5917585) (← links)
- Pseudorandom generators without the XOR lemma (Q5943089) (← links)
- (Q6084353) (← links)
- Is it possible to improve Yao's XOR lemma using reductions that exploit the efficiency of their oracle? (Q6113106) (← links)
