400 search results - page 1 / 80 » Lower Bounds Using Kolmogorov Complexity |
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...
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...
FSTTCS
2001
Springer
13 years 9 months ago
2001
Springer
This paper has the following goals: – To survey some of the recent developments in the field of derandomization. – To introduce a new notion of time-bounded Kolmogorov complex...
MFCS
1997
Springer
13 years 8 months ago
1997
Springer
We prove an exponential lower bound for the length of any resolution proof for the same set of clauses as the one used by Urquhart [13]. Our contribution is a significant simpli...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
Randomness extraction is the process of constructing a source of randomness of high quality from one or several sources of randomness of lower quality. The problem can be modeled ...