Abstract
We survey recent developments related to the Minimum Circuit Size Problem and time-bounded Kolmogorov Complexity.
Publisher
New Zealand Journal of Mathematics Committee
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A circuit complexity formulation of algorithmic information theory;Physica D: Nonlinear Phenomena;2023-12
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. A Duality between One-Way Functions and Average-Case Symmetry of Information;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
4. NP-Hardness of Learning Programs and Partial MCSP;2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10