Abstract
Allender, Friedman, and Gasarch recently proved an upper bound of pspace for the class DTTR K of decidable languages that are polynomial-time truth-table reducible to the set of prefix-free Kolmogorov-random strings regardless of the universal machine used in the definition of Kolmogorov complexity. It is conjectured that DTTR K in fact lies closer to its lower bound BPP established earlier by Buhrman, Fortnow, Koucký, and Loff. It is also conjectured that we have similar bounds for the analogous class DTTR C defined by plain Kolmogorov randomness. In this paper, we provide further evidence for these conjectures. First, we show that the time-bounded analogue of DTTR C sits between BPP and pspace ∩ P/poly. Next, we show that the class DTTR C, α obtained from DTTR C by imposing a restriction on the reduction lies between BPP and pspace. Finally, we show that the class P/R\(^{=log}_{c}\) obtained by further restricting the reduction to ask queries of logarithmic length lies between BPP and \(\Sigma^{p}_{2} \cap\) P/poly.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
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. In: Rovan, B., Sassone, V., Widmayer, P. (eds.) MFCS 2012. LNCS, vol. 7464, pp. 88–99. Springer, Heidelberg (2012)
Allender, E., Friedman, L., Gasarch, W.: Limits on the computational power of random strings. Information and Computation 222, 80–92 (2013)
Arora, S., Barak, B.: Computational Complexity: A Modern Approach, 1st edn. Cambridge University Press (2009)
Buhrman, H., Fortnow, L., Koucký, M., Loff, B.: Derandomizing from random strings. In: Proceedings of the 25th Annual Conference on Computational Complexity, CCC 2010, pp. 58–63 (2010)
Impagliazzo, R., Wigderson, A.: P = BPP if E requires exponential circuits: Derandomizing the xor lemma. In: Proceedings of the 29th Annual ACM Symposium on Theory of Computing, STOC 1997, pp. 220–229 (1997)
Li, M., Vitányi, P.: An Introduction to Kolmogorov Complexity and Its Applications, 3rd edn. Springer Publishing Company (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hirahara, S., Kawamura, A. (2014). On Characterizations of Randomized Computation Using Plain Kolmogorov Complexity. In: Csuhaj-Varjú, E., Dietzfelbinger, M., Ésik, Z. (eds) Mathematical Foundations of Computer Science 2014. MFCS 2014. Lecture Notes in Computer Science, vol 8635. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-44465-8_30
Download citation
DOI: https://doi.org/10.1007/978-3-662-44465-8_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-44464-1
Online ISBN: 978-3-662-44465-8
eBook Packages: Computer ScienceComputer Science (R0)