Reductions to the Set of Random Strings: The Resource-Bounded Case
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  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.
KeywordsTuring Machine Random Oracle Winning Strategy Kolmogorov Complexity Random String
Unable to display preview. Download preview PDF.
- 2.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)Google Scholar
- 5.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)Google Scholar
- 6.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-139Google Scholar
- 7.Balcázar, J.L., Días, J., Gabarró, J.: Structural Complexity I. Springer (1988)Google Scholar
- 8.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)Google Scholar
- 12.Li, M., Vitanyi, P.: Introduction to Kolmogorov Complexity and its Applications, 3rd edn. Springer (2008)Google Scholar