Pages that link to "Item:Q5428808"
From MaRDI portal
The following pages link to On the Complexity of Hard-Core Set Constructions (Q5428808):
Displaying 5 items.
- Complexity of hard-core set proofs (Q451110) (← 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)
- Computational Randomness from Generalized Hardcore Sets (Q3088271) (← links)
- Pseudoentropy: Lower-Bounds for Chain Rules and Transformations (Q3179357) (← links)
