Sciweavers

Share
CIE
2009
Springer

On Generating Independent Random Strings

9 years 4 months ago
On Generating Independent Random Strings
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.
Marius Zimand
Added 26 May 2010
Updated 26 May 2010
Type Conference
Year 2009
Where CIE
Authors Marius Zimand
Comments (0)
books