Average-case hardness of NP from exponential worst-case hardness assumptions

DOI10.1145/3406325.3451065OpenAlexW3168614261MaRDI QIDQ6087002

Shuichi Hirahara

Publication date: 14 November 2023

Published in: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3406325.3451065

zbMATH Keywords

average-case complexitypseudorandomnesscomputational depthtime-bounded Kolmogorov complexitymeta-complexity

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Non-Black-Box Worst-Case to Average-Case Reductions Within \(\mathsf{NP}\)

This page was built for publication: Average-case hardness of NP from exponential worst-case hardness assumptions