63 search results - page 2 / 13 » Lower Bounds for Reducibility to the Kolmogorov Random Strin... |
CORR
2008
Springer
13 years 5 months ago
2008
Springer
Depth of an object concerns a tradeoff between computation time and excess of program length over the shortest program length required to obtain the object. It gives an unconditio...
CIE
2006
Springer
13 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...
COCO
2010
Springer
13 years 9 months ago
2010
Springer
—In this paper we show that BPP is truth-table reducible to the set of Kolmogorov random strings RK . It was previously known that PSPACE, and hence BPP is Turingreducible to RK ...
EUROCRYPT
1999
Springer
13 years 10 months ago
1999
Springer
We prove the first general and non-trivial lower bound for the number of times a 1-out-of-n Oblivious Transfer of strings of length should be invoked so as to obtain, by an inform...
COCO
2004
Springer
13 years 11 months ago
2004
Springer
The language compression problem asks for succinct descriptions of the strings in a language A such that the strings can be efficiently recovered from their description when given...