On the Complexity of Hard-Core Set Constructions

DOI10.1007/978-3-540-73420-8_18zbMath1171.68484OpenAlexW1517026276MaRDI QIDQ5428808

Hsin-Lung Wu, Shi-Chun Tsai, Chi-Jen Lu

Publication date: 28 November 2007

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73420-8_18

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (5)

Pseudoentropy: Lower-Bounds for Chain Rules and Transformations ⋮ Nonuniform Indistinguishability and Unpredictability Hardcore Lemmas: New Proofs and Applications to Pseudoentropy ⋮ Complexity of hard-core set proofs ⋮ Lower Bounds on the Query Complexity of Non-uniform and Adaptive Reductions Showing Hardness Amplification ⋮ Computational Randomness from Generalized Hardcore Sets

This page was built for publication: On the Complexity of Hard-Core Set Constructions