On generating independent random strings

Simple item page
dc.creatorZimand, Marius
dc.date2009-03-23
dc.date.accessioned2026-07-07T12:55:42Z
dc.date.available2026-07-07T12:55:42Z
dc.descriptionIt 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.
dc.descriptionCiE 2009, Heidelberg
dc.identifierhttps://arxiv.org/abs/0903.3889
dc.identifierhttp://arxiv.org/abs/0903.3889
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/224342
dc.subjectInformation Theory
dc.subjectComputational Complexity
dc.titleOn generating independent random strings
dc.typetext

Files

Collections

arXiv