Publisher
Springer International Publishing
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. NP-Hardness of Approximating Meta-Complexity: A Cryptographic Approach;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
2. Nonuniform Reductions and NP-Completeness;Theory of Computing Systems;2022-06-01
3. On One-way Functions and Kolmogorov Complexity;2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS);2020-11
4. Characterizing Average-Case Complexity of PH by Worst-Case Meta-Complexity;2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS);2020-11
5. Unexpected Hardness Results for Kolmogorov Complexity under Uniform Reductions;ACM S THEORY COMPUT;2020