Average Case Complexity Under the Universal Distribution Equals Worst-Case Complexity

Abstract The average complexity of any algorithm whatsoever under the universal distribution is of the same order of magnitude as the worst-case complexity. This holds both for time complexity and for space complexity. To focus our discussion, we use as illustrations the particular case of sorting algorithms, and the general case of the average case complexity of NP-complete problems.

[1]  Ming Li,et al.  Kolmogorov Complexity and its Applications , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[2]  Leonid A. Levin,et al.  Average Case Complete Problems , 1986, SIAM J. Comput..

[3]  Ray J. Solomonoff,et al.  A Formal Theory of Inductive Inference. Part II , 1964, Inf. Control..

[4]  Peter Bro Miltersen.  The complexity of malign ensembles , 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.

[5]  Ming Li,et al.  Inductive reasoning and Kolmogorov complexity , 1989, [1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference.

[6]  Oded Goldreich,et al.  On the theory of average case complexity , 1989, STOC '89.

[7]  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 .

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