Document Open Access Logo

Search-To-Decision Reductions for Kolmogorov Complexity

Authors Noam Mazor, Rafael Pass

PDF

File

Thumbnail PDF
PDF
LIPIcs.CCC.2024.34.pdf
  • Filesize: 0.74 MB
  • 20 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Computational complexity and cryptography
Keywords
  • Kolmogorov complexity
  • search to decision

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

A long-standing open problem dating back to the 1960s is whether there exists a search-to-decision reduction for the time-bounded Kolmogorov complexity problem - that is, the problem of determining whether the length of the shortest time-t program generating a given string x is at most s.
In this work, we consider the more "robust" version of the time-bounded Kolmogorov complexity problem, referred to as the GapMINKT problem, where given a size bound s and a running time bound t, the goal is to determine whether there exists a poly(t,|x|)-time program of length s+O(log |x|) that generates x. We present the first non-trivial search-to-decision reduction R for the GapMINKT problem; R has a running-time bound of 2^{ε n} for any ε > 0 and additionally only queries its oracle on "thresholds" s of size s+O(log |x|). As such, we get that any algorithm with running-time (resp. circuit size) 2^{α s} poly(|x|,t,s) for solving GapMINKT (given an instance (x,t,s), yields an algorithm for finding a witness with running-time (resp. circuit size) 2^{(α+ε) s} poly(|x|,t,s).
Our second result is a polynomial-time search-to-decision reduction for the time-bounded Kolmogorov complexity problem in the average-case regime. Such a reduction was recently shown by Liu and Pass (FOCS'20), heavily relying on cryptographic techniques. Our reduction is more direct and additionally has the advantage of being length-preserving, and as such also applies in the exponential time/size regime.
A central component in both of these results is the use of Kolmogorov and Levin’s Symmetry of Information Theorem.

Cite As Get BibTex

Noam Mazor and Rafael Pass. Search-To-Decision Reductions for Kolmogorov Complexity. In 39th Computational Complexity Conference (CCC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 300, pp. 34:1-34:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024) https://doi.org/10.4230/LIPIcs.CCC.2024.34

Author Details

Noam Mazor
  • Tel Aviv University, Israel
Rafael Pass
  • Tel Aviv University, Israel
  • Cornell Tech, New York, NY, USA

Funding

  • Mazor, Noam: Research partly supported by NSF CNS-2149305 and DARPA under Agreement No. HR00110C0086.
  • Pass, Rafael: Supported in part by AFOSR Award FA9550-23-1-0387, AFOSR Award FA9550-23-1-0312, and an Algorand Foundation grant. This material is based upon work supported by DARPA under Agreement No. HR00110C0086. Any opinions, findings and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the United States Government, DARPA, AFOSR or the Algorand Foundation.

References

  1. Luis Antunes, Lance Fortnow, Dieter Van Melkebeek, and N Variyam Vinodchandran. Computational depth: concept and applications. Theoretical Computer Science, 354(3):391-404, 2006. Google Scholar
  2. Gregory J. Chaitin. On the simplicity and speed of programs for computing infinite sets of natural numbers. J. ACM, 16(3):407-422, 1969. Google Scholar
  3. Venkatesan Guruswami and Piotr Indyk. Expander-based constructions of efficiently decodable codes. In Proceedings 42nd IEEE Symposium on Foundations of Computer Science, pages 658-667. IEEE, 2001. Google Scholar
  4. Venkatesan Guruswami, Atri Rudra, and Madhu Sudan. Essential coding theory. Draft available at https://cse.buffalo.edu/faculty/atri/courses/coding-theory/book/web-coding-book.pdf, 2(1), 2012.
  5. Venkatesan Guruswami and Madhu Sudan. Improved decoding of reed-solomon and algebraic-geometric codes. In Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No. 98CB36280), pages 28-37. IEEE, 1998. Google Scholar
  6. J. Hartmanis. Generalized kolmogorov complexity and the structure of feasible computations. In 24th Annual Symposium on Foundations of Computer Science (sfcs 1983), pages 439-445, 1983. URL: https://doi.org/10.1109/SFCS.1983.21.
  7. Johan Hastad, Russell Impagliazzo, Leonid A. Levin, and Michael Luby. A pseudorandom generator from any one-way function. SIAM Journal on Computing, pages 1364-1396, 1999. Google Scholar
  8. Shuichi Hirahara. Non-black-box worst-case to average-case reductions within np. In 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), pages 247-258. IEEE, 2018. Google Scholar
  9. Shuichi Hirahara. Non-disjoint promise problems from meta-computational view of pseudorandom generator constructions. In 35th Computational Complexity Conference (CCC 2020). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. Google Scholar
  10. Shuichi Hirahara. Symmetry of information from meta-complexity. In 37th Computational Complexity Conference (CCC 2022). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. Google Scholar
  11. Shuichi Hirahara, Rahul Ilango, and Ryan Williams. Beating brute force for compression problems. Technical Report TR23-171, Electronic Colloquium on Computational Complexity, 2023. Google Scholar
  12. Valentine Kabanets and Jin-yi Cai. Circuit minimization problem. In Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, May 21-23, 2000, Portland, OR, USA, pages 73-79, 2000. Google Scholar
  13. Ker-I Ko. On the notion of infinite pseudorandom sequences. Theor. Comput. Sci., 48(3):9-33, 1986. URL: https://doi.org/10.1016/0304-3975(86)90081-2.
  14. A. N. Kolmogorov. Three approaches to the quantitative definition of information. International Journal of Computer Mathematics, 2(1-4):157-168, 1968. Google Scholar
  15. Leonid A. Levin. Universal'nyĭe perebornyĭezadachi (Universal search problems : in Russian). Problemy Peredachi Informatsii, pages 265-266, 1973. Google Scholar
  16. Yanyi Liu and Rafael Pass. On one-way functions and kolmogorov complexity. In 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), pages 1243-1254. IEEE, 2020. Google Scholar
  17. Noam Mazor and Rafael Pass. The non-uniform perebor conjecture for time-bounded kolmogorov complexity is false. 15th Innovations in Theoretical Computer Science, 2024. Google Scholar
  18. Noam Mazor and Rafael Pass. Search-to-decision reductions for kolmogorov1 complexity. Electronic Colloquium on Computational Complexity, 2024. Google Scholar
  19. Irving S Reed and Gustave Solomon. Polynomial codes over certain finite fields. Journal of the society for industrial and applied mathematics, 8(2):300-304, 1960. Google Scholar
  20. Michael Sipser. A complexity theoretic approach to randomness. In Proceedings of the 15th Annual ACM Symposium on Theory of Computing (STOC), pages 330-335, 1983. Google Scholar
  21. R.J. Solomonoff. A formal theory of inductive inference. part i. Information and Control, 7(1):1-22, 1964. URL: https://doi.org/10.1016/S0019-9958(64)90223-2.
  22. Boris A Trakhtenbrot. A survey of russian approaches to perebor (brute-force searches) algorithms. Annals of the History of Computing, 6(4):384-400, 1984. Google Scholar
  23. Sergey Yablonski. The algorithmic difficulties of synthesizing minimal switching circuits. Problemy Kibernetiki, 2(1):75-121, 1959. Google Scholar
  24. Sergey V Yablonski. On the impossibility of eliminating perebor in solving some problems of circuit theory. Doklady Akademii Nauk SSSR, 124(1):44-47, 1959. Google Scholar
  25. A. C. Yao. Protocols for secure computations. In Annual Symposium on Foundations of Computer Science (FOCS), pages 160-164, 1982. Google Scholar
  26. Alexander K Zvonkin and Leonid A Levin. The complexity of finite objects and the development of the concepts of information and randomness by means of the theory of algorithms. Russian Mathematical Surveys, 25(6):83, 1970. Google Scholar
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact