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. © 2009 Springer Berlin Heidelberg.
CITATION STYLE
Zimand, M. (2009). On generating independent random strings. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5635 LNCS, pp. 499–508). https://doi.org/10.1007/978-3-642-03073-4_51
Mendeley helps you to discover research relevant for your work.