98 search results - page 2 / 20 » Kolmogorov Complexity in Randomness Extraction |
APAL
2004
13 years 4 months ago
2004
We investigate the initial segment complexity of random reals. Let K( ) denote pre
ICALP
2007
Springer
13 years 10 months ago
2007
Springer
While data compression and Kolmogorov complexity are both about effective coding of words, the two settings differ in the following respect. A compression algorithm or compressor...
COCO
2003
Springer
13 years 9 months ago
2003
Springer
We review and slightly strengthen known results on the Kolmogorov complexity of prefixes of effectively random sequences. First, there are recursively random random sequences su...
COCO
2004
Springer
13 years 10 months ago
2004
Springer
We prove a very general lower bound technique for quantum and randomized query complexity, that is easy to prove as well as to apply. To achieve this, we introduce the use of Kolm...
STACS
2009
Springer
2009
Springer
Extracting the Kolmogorov Complexity of Strings and Sequences from Sources with Limited Independence
13 years 11 months ago
