Publisher
Springer Berlin Heidelberg
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A Direct PRF Construction from Kolmogorov Complexity;Lecture Notes in Computer Science;2024
2. NP-Hardness of Approximating Meta-Complexity: A Cryptographic Approach;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
3. Robustness of average-case meta-complexity via pseudorandomness;Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing;2022-06-09
4. Nonuniform Reductions and NP-Completeness;Theory of Computing Systems;2022-06-01
5. Cryptography from sublinear-time average-case hardness of time-bounded Kolmogorov complexity;Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing;2021-06-15