Unexpected hardness results for Kolmogorov complexity under uniform reductions

DOI10.1145/3357713.3384251OpenAlexW3034183797MaRDI QIDQ5144987

Shuichi Hirahara

Publication date: 19 January 2021

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

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

zbMATH Keywords

Kolmogorov complexitypseudorandomness(black-box) reductions

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (5)

Some games on Turing machines and power from random strings ⋮ ON THE EXISTENCE OF STRONG PROOF COMPLEXITY GENERATORS ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Vaughan Jones, Kolmogorov Complexity, and the New Complexity Landscape around Circuit Minimization

This page was built for publication: Unexpected hardness results for Kolmogorov complexity under uniform reductions