Resource-bounded randomness and compressibility with respect to nonuniform measures

This publication has 12 references indexed in Scilit:

• Generating Quasi-Random Sequences From Slightly-Random Sources
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2005
• Extracting randomness: how and why. A survey
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• Equivalence of measures of complexity classes
  Published by Springer Nature ,1997
• Algorithmic Complexity and Randomness: Recent Developments
  Theory of Probability and Its Applications, 1993
• Almost everywhere high nonuniform complexity
  Journal of Computer and System Sciences, 1992
• Von Mises' definition of random sequences reconsidered
  The Journal of Symbolic Logic, 1987
• Arithmetic coding for data compression
  Communications of the ACM, 1987
• Random polynomial time is equal to slightly-random polynomial time
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1985
• 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, 1970
• On Equivalence of Infinite Product Measures
  Annals of Mathematics, 1948