Resource-bounded randomness and compressibility with respect to nonuniform measures

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

Volumn 1269, Issue , 1997, Pages 197-211

  Kautz, Steven M ^a  

^a RANDOLPH COLLEGE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CHARACTERIZATION; COMPRESSIBILITY; PROBABILITY DENSITY FUNCTION;

CLASSICAL THEOREMS; LEBESGUE MEASURE; PROBABILITY DENSITIES; PRODUCT MEASURES; RESOURCE-BOUNDED; RESOURCE-BOUNDED MEASURE;

RANDOM PROCESSES;

EID: 84957681613     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63248-4_17     Document Type: Conference Paper

References (20)

1. J.M. Breutzmann and J. H. Lutz, Equivalence of measures of complexity classes. 1996. To appear.
2. H. Buhrman and L. Longpré. Compressibility and resource bounded measure. 1995 STACS.
3. W. Feller. An Introduction to Probability Theory and its Applications. Volume 2, John Wiley and Sons, Inc., 1971.
4. P.R. Halmos. Measure Theory. Springer-Verlag, 1974.
5. S. Kakutani. On the equivalence of infinite product measures. Annals of Mathematics, 49:214-224, 1948.
6. S. M. Kautz. Degrees of Random Sets. PhD thesis, Cornell University, 1991.
7. M. Li and P. Vitányi. An Introduction to Kolmogorov Complexity and Its Applications. Springer-Verlag, 1993.
8. J. H. Lutz. The quantitative structure of exponential time. In Proceedings of the Eighth Annual Structure in Complexity Theory Conference, pages 158-175, 1993. Updated version to appear in L. A. Hemaspaandra and A. L. Selman (eds.), Complexity Theory Retrospective II, Springer-Verlag, 1996.
9. J. H. Lutz and E. Mayordomo. Genericity, measure, and inseparable pairs. 1996. In preparation.
10. J.H. Lutz. Almost everywhere high nonuniform complexity. Journal of Computer and System Sciences, 44:220-258, 1992.
11. E. Mayordomo. Contributions to the Study of Resource-Bounded Measure. PhD thesis, Universität Politècnica de Catalunya, 1994.
12. Noam Nisan. Extracting randomness: how and why. A survey. In Proceedings of the 11th IEEE Conference on Computational Complexity, 1996.
13. M. Santha and U.V. Vazirani. Generating quasi-random sequences from slightly- random sources. In Proc. 25th Ann. Symp. on the Theory of Computing, 1984.
14. A. Kh. Shen'. Algorithmic complexity and randomness: recent developments. Theory Probab. Appl., 37(3):92-97, 1993.
15. A. Kh. Shen'. On relations between different algorithmic definitions of randomness. Soviet Math. Dokl., 38(2):316-319, 1989.
16. M. van Lambalgen. Random Sequences. PhD thesis, University of Amsterdam, 1987.
17. M. van Lambalgen. Von Mises' definition of random sequences reconsidered. Journal of Symbolic Logic, 52(3):725-755, 1987.
18. U.V. Vazirani and V.V. Vazirani. Random polynomial time is equal to slightly- random polynomial time. In Proceedings of the 26th IEEE Symposium on Foundations of Computer Science, 1985.
19. I. H. Witten, R. M. Neal, and J. G. Cleary. Arithmetic coding for data compression. Communications of the Association for Computing Machinery, 30:520-540, 1987.
20. A.K. Zvonkin and L.A. Levin. The complexity of finite objects and the development of the concepts of information and randomness by means of the theory of algorithms. Russian Mathematical Surveys, 25:83-123, 1970.