Independent minimum length programs to translate between given strings
Theoretical Computer Science
Extractors with weak random seeds
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
A 2-Source Almost-Extractor for Linear Entropy
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Algorithmically Independent Sequences
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Two sources are better than one for increasing the Kolmogorov complexity of infinite sequences
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
Extracting kolmogorov complexity with applications to dimension zero-one laws
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Counting dependent and independent strings
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Impossibility of independence amplification in Kolmogorov complexity theory
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Extracting Kolmogorov complexity with applications to dimension zero-one laws
Information and Computation
| Hi-index | 0.00 |
It is shown that from two strings that are partially random and independent (in the sense of Kolmogorov complexity) it is possible to effectively construct polynomially many strings that are random and pairwise independent. If the two initial strings are random, then the above task can be performed in polynomial time. It is also possible to construct in polynomial time a random string, from two strings that have constant randomness rate.