On Generating Independent Random Strings
From MaRDI portal
Publication:3576088
DOI10.1007/978-3-642-03073-4_51zbMath1268.68090arXiv0903.3889OpenAlexW1506273678MaRDI QIDQ3576088
Publication date: 28 July 2010
Published in: Mathematical Theory and Computational Practice (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0903.3889
Related Items (2)
Algorithmically independent sequences ⋮ Extracting Kolmogorov complexity with applications to dimension zero-one laws
Cites Work
- Two sources are better than one for increasing the Kolmogorov complexity of infinite sequences
- Algorithmically Independent Sequences
- A 2-Source Almost-Extractor for Linear Entropy
- Extractors with weak random seeds
- Extracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws
- MORE ON THE SUM-PRODUCT PHENOMENON IN PRIME FIELDS AND ITS APPLICATIONS
- Extracting the Kolmogorov Complexity of Strings and Sequences from Sources with Limited Independence
- THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
- Independent minimum length programs to translate between given strings
This page was built for publication: On Generating Independent Random Strings