Short lists for shortest descriptions in short time

Is it possible to find a shortest description for a binary string? The well-known answer is “no, Kolmogorov complexity is not computable.” Faced with this barrier, one might instead seek a short list of candidates which includes a laconic description. Remarkably such approximations exist. This paper presents an efficient algorithm which generates a polynomial-size list containing an optimal description for a given input string. Along the way, we employ expander graphs and randomness dispersers to obtain an Explicit Online Matching Theorem for bipartite graphs and a refinement of Muchnik’s Conditional Complexity Theorem. Our main result extends recent work by Bauwens, Mahklin, Vereshchagin, and Zimand.

[1]  P. Hall.  On Representatives of Subsets , 1935 .

[2]  L. Levin,et al.  THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS , 1970 .

[3]  Lance Fortnow,et al.  Resource-Bounded Kolmogorov Complexity Revisited , 1997, STACS.

[4]  Marius Zimand.  Short Lists with Short Programs in Short Time - A Short Proof , 2014, CiE.

[5]  Andrej Muchnik,et al.  Conditional complexity and codes , 2002, Theor. Comput. Sci..

[6]  Enkatesan G Uruswami.  Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes , 2008 .

[7]  Lance Fortnow,et al.  Enumerations of the Kolmogorov function , 2006, Journal of Symbolic Logic.

[8]  Paul M. B. Vitányi,et al.  An Introduction to Kolmogorov Complexity and Its Applications , 1993, Graduate Texts in Computer Science.

[9]  Nikolai K. Vereshchagin,et al.  Short lists with short programs in short time , 2013, 2013 IEEE Conference on Computational Complexity.

[10]  Amnon Ta-Shma,et al.  Lossless Condensers, Unbalanced Expanders, And Extractors , 2007, Comb..

[11]  Daniil Musatov,et al.  Improving the Space-Bounded Version of Muchnik’s Conditional Complexity Theorem via “Naive” Derandomization , 2010, Theory of Computing Systems.

[12]  Ming Li,et al.  An Introduction to Kolmogorov Complexity and Its Applications , 1997, Texts in Computer Science.

[13]  Alexander Shen,et al.  Variations on Muchnik’s Conditional Complexity Theorem , 2009, Theory of Computing Systems.