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
2010
ACM
14 years 1 months ago
2010
ACM
We consider the complexity of sorting strings in the model that counts comparisons between symbols and not just comparisons between strings. We show that for any set of strings S ...