Pages that link to "Item:Q1394786"
From MaRDI portal
The following pages link to Boosting and hard-core set construction (Q1394786):
Displayed 14 items.
- A complete characterization of statistical query learning with applications to evolvability (Q439989) (← links)
- Complexity of hard-core set proofs (Q451110) (← links)
- Lower bounds on the query complexity of non-uniform and adaptive reductions showing hardness amplification (Q744610) (← links)
- Query complexity in errorless hardness amplification (Q901934) (← links)
- Amplifying the security of functional encryption, unconditionally (Q2096505) (← 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)
- 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)
- Computational Randomness from Generalized Hardcore Sets (Q3088271) (← links)
- (Q5092470) (← links)
- (Q6054746) (← links)
- (Q6084353) (← links)
- Is it possible to improve Yao's XOR lemma using reductions that exploit the efficiency of their oracle? (Q6113106) (← links)