Characterizing derandomization through hardness of Levin-Kolmogorov complexity

DOI10.4230/LIPICS.CCC.2022.35MaRDI QIDQ6568378zbMATH OpenFDO

Authors Yanyi Liu, Rafael Pass

Publication date 5 July 2024

Full work available at URL https://doi.org/10.4230/LIPICS.CCC.2022.35

zbMATH Keywords

derandomizationhitting set generatorsKolmogorov complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cited in

(6)

• A direct PRF construction from Kolmogorov complexity
• Instance-wise hardness and refutation versus derandomization for Arthur-Merlin protocols
• Leakage resilience, targeted pseudorandom generators, and mild derandomization of Arthur-Merlin protocols
• On exponential-time hypotheses, derandomization, and circuit lower bounds
• Data reconstruction: when you see it and when you don't
• Towards free lunch derandomization from necessary assumptions (and OWFs)

This page was built for publication: Characterizing derandomization through hardness of Levin-Kolmogorov complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6568378)