98 search results - page 3 / 20 » Kolmogorov Complexity in Randomness Extraction |
IANDC
2011
12 years 11 months ago
2011
APAL
2006
13 years 4 months ago
2006
If x = x1x2
CIE
2006
Springer
13 years 8 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...
MFCS
2009
Springer
13 years 9 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...
EATCS
1998
13 years 4 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...