Abstract
This paper is motivated by a conjecture [1,5] that BPP can be characterized in terms of polynomial-time nonadaptive reductions to the set of Kolmogorov-random strings. In this paper we show that an approach laid out in [5] to settle this conjecture cannot succeed without significant alteration, but that it does bear fruit if we consider time-bounded Kolmogorov complexity instead.
We show that if a set A is reducible in polynomial time to the set of time-t-bounded Kolmogorov-random strings (for all large enough time bounds t), then A is in P/poly, and that if in addition such a reduction exists for any universal Turing machine one uses in the definition of Kolmogorov complexity, then A is in PSPACE.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Allender, E.: Curiouser and Curiouser: The Link between Incompressibility and Complexity. In: Cooper, S.B., Dawar, A., Löwe, B. (eds.) CiE 2012. LNCS, vol. 7318, pp. 11–16. Springer, Heidelberg (2012)
Allender, E., Buhrman, H., Friedman, L., Loff, B.: Reductions to the set of random strings:the resource-bounded case. Technical Report TR12-054, ECCC (2012)
Allender, E., Buhrman, H., Koucký, M.: What can be efficiently reduced to the Kolmogorov-random strings? Annals of Pure and Applied Logic 138, 2–19 (2006)
Allender, E., Buhrman, H., Koucký, M., van Melkebeek, D., Ronneburger, D.: Power from random strings. SIAM Journal on Computing 35, 1467–1493 (2006)
Allender, E., Davie, G., Friedman, L., Hopkins, S.B., Tzameret, I.: Kolmogorov complexity, circuits, and the strength of formal theories of arithmetic. Technical Report TR12-028, ECCC (2012) (submitted for publication)
Allender, E., Friedman, L., Gasarch, W.: Limits on the computational power of random strings. Information and Computation (to appear, 2012); special issue on ICALP 2011, See also ECCC TR10-139
Balcázar, J.L., Días, J., Gabarró, J.: Structural Complexity I. Springer (1988)
Buhrman, H., Fortnow, L., Koucký, M., Loff, B.: Derandomizing from random strings. In: 25th IEEE Conference on Computational Complexity (CCC), pp. 58–63. IEEE (2010)
Buhrman, H., Fortnow, L., Newman, I., Vereshchagin, N.K.: Increasing Kolmogorov Complexity. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol. 3404, pp. 412–421. Springer, Heidelberg (2005)
Buhrman, H., Mayordomo, E.: An excursion to the Kolmogorov random strings. J. Comput. Syst. Sci. 54(3), 393–399 (1997)
Juedes, D.W., Lutz, J.H.: Modeling time-bounded prefix Kolmogorov complexity. Theory of Computing Systems 33(2), 111–123 (2000)
Li, M., Vitanyi, P.: Introduction to Kolmogorov Complexity and its Applications, 3rd edn. Springer (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Allender, E., Buhrman, H., Friedman, L., Loff, B. (2012). Reductions to the Set of Random Strings: The Resource-Bounded Case. In: Rovan, B., Sassone, V., Widmayer, P. (eds) Mathematical Foundations of Computer Science 2012. MFCS 2012. Lecture Notes in Computer Science, vol 7464. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32589-2_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-32589-2_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32588-5
Online ISBN: 978-3-642-32589-2
eBook Packages: Computer ScienceComputer Science (R0)