Abstract
Many theorems about Kolmogorov complexity rely on existence of combinatorial objects with specific properties. Usually the probabilistic method gives such objects with better parameters than explicit constructions do. But the probabilistic method does not give “effective” variants of such theorems, i.e. variants for resource-bounded Kolmogorov complexity. We show that a “naive derandomization” approach of replacing these objects by the output of Nisan-Wigderson pseudo-random generator may give polynomial-space variants of such theorems.
Specifically, we improve the preceding polynomial-space analogue of Muchnik’s conditional complexity theorem. I.e., for all a and b there exists a program p of least possible length that transforms a to b and is simple conditional on b. Here all programs work in polynomial space and all complexities are measured with logarithmic accuracy instead of polylogarithmic one in the previous work.
Supported by ANR Sycomore, NAFIT ANR-08-EMER-008-01 and RFBR 09-01-00709-a grants.
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
Ajtai, M.: Approximate counting with uniform constant-depth circuits. In: Advances in computational complexity theory, pp. 1–20. American Mathematical Society, Providence (1993)
Buhrman, H., Fortnow, L., Laplante, S.: Resource bounded Kolmogorov complexity revisited. SIAM Journal on Computing 31(3), 887–905 (2002)
Buhrman, H., Lee, T., van Melkebeek, D.: Language compression and pseudorandom generators. In: Proc. of the 15th IEEE Conference on Computational Complexity. IEEE, Los Alamitos (2004)
Dvir, Z., Wigderson, A.: Kakeya sets, new mergers and old extractors. In: Proceedings of the 49th Annual FOCS 2008, pp. 625–633 (2008)
Guruswami, V., Umans, C., Vadhan, S.: Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes. Journal of the ACM 56(4) (2009)
Li, M., Vitanyi, P.: An Introduction to Kolmogorov Complexity and Its Applications, 2nd edn. Springer, Heidelberg (1997)
Lu, C.-J., Reingold, O., Vadhan, S., Wigderson, A.: Extractors: Optimal up to Constant Factors. In: 35th Annual ACM Symposium, STOC 2003, pp. 602–611 (2003)
Muchnik, A.A.: On basic structures of the descriptive theory of algorithms. Soviet Math. Dokl. 32, 671–674 (1985)
Muchnik, A.: Conditional complexity and codes. Theoretical Computer Science 271(1-2), 97–109 (2002)
Musatov, D.: Extractors and an effective variant of Muchnik’s theorem. Diplom (Master thesis).Faculty of Mechanics and Mathematics, MSU (2006) (in Russian), http://arxiv.org/abs/0811.3958
Musatov, D.: Improving the space-bounded version of Muchnik’s conditional complexity theorem via “naive” derandomization (2010), http://arxiv.org/abs/1009.5108 (Online version of this paper)
Musatov, D., Romashchenko, A., Shen, A.: Variations on muchnik’s conditional complexity theorem. In: Frid, A., Morozov, A., Rybalchenko, A., Wagner, K.W. (eds.) CSR 2009. LNCS, vol. 5675, pp. 250–262. Springer, Heidelberg (2009)
Musatov, D., Romashchenko, A., Shen, A.: Variations on Muchnik’s conditional complexity theorem, to be published in TOCS
Nisan, N.: Pseudorandom bits for constant depth circuits. Combinatorica 11(1), 63–70 (1991)
Nisan, N., Wigderson, A.: Hardness vs. Randomness. Journal of Computer and System Sciences 49, 149–167 (1994)
Radhakrishnan, J., Ta-Shma, A.: Bounds for dispersers, extractors, and depth-two superconcentrators. SIAM Journal on Discrete Mathematics 13(1), 2–24 (2000)
Reingold, O., Shaltiel, R., Wigderson, A.: Extracting randomness via repeated condensing. SIAM Journal on Computing 35(5), 1185–1209 (2006)
Romashchenko, A.: Pseudo-random graphs and bit probe schemes with one-sided error. In: CSR 2011
Slepian, D., Wolf, J.K.: Noiseless coding of correlated information sources. IEEE Transactions on information Theory 19, 471–480 (1973)
Trevisan, L.: Construction of extractors using pseudo-random generators. In: Proc. 45th Annual Symposium on Foundations of Computer Science, pp. 264–275
Zvonkin, A., Levin, L.: 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–124 (1970)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Musatov, D. (2011). Improving the Space-Bounded Version of Muchnik’s Conditional Complexity Theorem via “Naive” Derandomization. In: Kulikov, A., Vereshchagin, N. (eds) Computer Science – Theory and Applications. CSR 2011. Lecture Notes in Computer Science, vol 6651. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20712-9_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-20712-9_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20711-2
Online ISBN: 978-3-642-20712-9
eBook Packages: Computer ScienceComputer Science (R0)