534 search results - page 1 / 107 » Power from Random Strings |
FOCS
2002
IEEE
13 years 9 months ago
2002
IEEE
CIE
2009
Springer
13 years 11 months ago
2009
Springer
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 strin...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
We prove a strong Symmetry of Information relation for random strings (in the sense of Kolmogorov complexity) and establish tight bounds on the amount on nonuniformity that is nec...
SODA
2004
ACM
13 years 6 months ago
2004
ACM
We are given a collection of m random subsequences (traces) of a string t of length n where each trace is obtained by deleting each bit in the string with probability q. Our goal ...
CORR
2010
Springer
13 years 1 months ago
2010
Springer
Suppose Alice and Bob receive strings of unbiased independent but noisy bits from some random source. They wish to use their respective strings to extract a common sequence of ran...