Universal distributions and time-bounded kolmogorov complexity

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1563, Issue , 1999, Pages 434-443

  Schuler, Rainer ^a  

^a UNIVERSITY OF ULM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; POLYNOMIAL APPROXIMATION;

A-PRIORI PROBABILITIES; KOLMOGOROV COMPLEXITY; NATURAL ANALOG; NEGATIVE EXPONENTIAL; POLYNOMIAL-TIME;

PROBABILITY DISTRIBUTIONS;

EID: 84957080367     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49116-3_41     Document Type: Conference Paper

References (11)

1. S. Ben-David, B. Chor, O. Goldreich, and M. Luby. On the theory of average case complexity. Journal of Computer and System Sciences, 44:193-219, 1992.
2. J. Castro and J. Balcázar. Simple PAC learning of simple decision lists. In Proceedings of the 6th Int'l Workshop on Algorithmic Learning Theory, volume 997 of Lecture Notes in Computer Science, pages 239-248. Springer-Verlag, 1995.
3. Shafi Goldwasser and Silvio Micali. Probabilistic encryption. Journal of Computer and System Sciences, 28(2):270-299, April 1984.
4. Y. Gurevich. Average case completeness. Journal of Computer and System Sciences, 42(3):346-398, 1991.
5. L. Levin. Average case complete problems. SIAM Journal on Computing, 15:285-286, 1986.
6. M. Li and P. Vitányi. An introduction to Kolmogorov complexity and its applications. Springer-Verlag, second edition edition, 1997.
7. M. Li and P.M.B. Vitányi. Learning simple concepts under simple distributions. SIAM Journal on Computing, 20(5):911-935, 1991.
8. M. Li and P.M.B. Vitányi. Average case complexity under the universal distribution equals worst-case complexity. Information Processing Letters, 42:145-149, 1992.
9. P.B. Milterson. The complexity of malign measures. SIAM Journal on Computing, 22(1):147-156, 1993.
10. R. Schuler. A note on universal distributions for polynomial-time computable distributions. In Proceedings of the 12th Annual IEEE Conference on Computational Complexity. IEEE Computer Society Press, 1997.
11. L. Valiant. A theory of the learnable. Communications of the ACM, 27(11):1134-1142, 1984.