98 search results - page 3 / 20 » Kolmogorov Complexity in Randomness Extraction |
158
click to vote
CIE
2006
Springer
15 years 9 months ago
2006
Springer
Abstract. In this paper, we survey a few recent applications of Kolmogorov complexity to lower bounds in several models of computation. We consider KI complexity of Boolean functio...
159
Voted
MFCS
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. A Solovay function is a computable upper bound g for prefixfree Kolmogorov complexity K that is nontrivial in the sense that g agrees with K, up to some additive constan...
173
click to vote
EATCS
1998
15 years 5 months ago
1998
Experiments have shown [2] that we can only memorize images up to a certain complexity level, after which, instead of memorizing the image itself, we, sort of, memorize a probabil...