Title :
Homogeneous measures and polynomial time invariants
Author :
Levin, Leorid A.
Author_Institution :
Dept. of Comput. Sci., Boston Univ., MA, USA
Abstract :
The usual probability distributions are concentrated on strings that do not differ noticeably in any fundamental characteristics, except their informational size (Kolmogorov complexity). The formalization of this statement is given and shown to distinguish a class of homogeneous probability measures suggesting various applications. In particular, it could explain why the average case NP-completeness results are so measure-independent and could lead to their generalization to this wider and more invariant class of measures. It also demonstrates a sharp difference between recently discovered pseudorandom strings and the objects known before
Keywords :
computational complexity; random number generation; Kolmogorov complexity; average case NP-completeness; homogeneous measures; polynomial time invariants; probability distributions; pseudorandom strings; Additives; Character generation; Electronic mail; Particle measurements; Polynomials; Set theory; Time measurement;
Conference_Titel :
Foundations of Computer Science, 1988., 29th Annual Symposium on
Conference_Location :
White Plains, NY
Print_ISBN :
0-8186-0877-3
DOI :
10.1109/SFCS.1988.21919