Boosting and hard-core set construction
From MaRDI portal
Publication:1394786
DOI10.1023/A:1022949332276zbMath1026.68066MaRDI QIDQ1394786
Rocco A. Servedio, Adam R. Klivans
Publication date: 25 June 2003
Published in: Machine Learning (Search for Journal in Brave)
Related Items (14)
Nonuniform Indistinguishability and Unpredictability Hardcore Lemmas: New Proofs and Applications to Pseudoentropy ⋮ Is it possible to improve Yao's XOR lemma using reductions that exploit the efficiency of their oracle? ⋮ Query complexity in errorless hardness amplification ⋮ A complete characterization of statistical query learning with applications to evolvability ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Complexity of hard-core set proofs ⋮ Unnamed Item ⋮ Lower bounds on the query complexity of non-uniform and adaptive reductions showing hardness amplification ⋮ Lower Bounds on the Query Complexity of Non-uniform and Adaptive Reductions Showing Hardness Amplification ⋮ Query Complexity in Errorless Hardness Amplification ⋮ Computational Randomness from Generalized Hardcore Sets ⋮ Advice Lower Bounds for the Dense Model Theorem ⋮ Amplifying the security of functional encryption, unconditionally
This page was built for publication: Boosting and hard-core set construction
