Abstract
A function μ(x) that assigns a nonnegative real number μ(x) to each bit string x is said to be malign if, for any algorithm, the worst-case computation time and the average computation time of the algorithm are functions, of the same order when each bit string x is given to the algorithm as an input with the probability that is proportional to the value μ(x). M. Li and P. M. B. Vitányi found that functions that are known as “universal distributions” are malign. We show that if μ(x) is a universal distribution and t is a positive real number, then the function μ(x) t is malign or not according as t≥1 or t<1. For t>1, μ(x) t is an example of malign functions that are not universal distributions.
Preview
Unable to display preview. Download preview PDF.
References
Kobayashi, K.: On malign input distributions for algorithms. IEICE Trans. on Information and Systems E76-D (1993) 634–640
Li, M., Vitányi, P. M. B.: Worst case complexity is equal to average case complexity under the universal distribution. Inform. Process. Lett. 42 (1992) 145–149
Li, M., Vitányi, P. M. B.: An Introduction to Kolmogorov Complexity and Its Applications. Springer-Verlag (1993)
Miltersen, P. B.: The complexity of malign ensembles. SIAM J. Computing 22 (1993) 147–156
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kobayashi, K. (1995). Transformations that preserve malignness of universal distributions. In: Du, DZ., Li, M. (eds) Computing and Combinatorics. COCOON 1995. Lecture Notes in Computer Science, vol 959. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030861
Download citation
DOI: https://doi.org/10.1007/BFb0030861
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60216-3
Online ISBN: 978-3-540-44733-7
eBook Packages: Springer Book Archive