7 search results - page 2 / 2 » Randomized vs.Deterministic Decision Tree Complexity for Rea... |
CIE
2006
Springer
13 years 10 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...
FOCS
1998
IEEE
13 years 10 months ago
1998
IEEE
We examine the number T of queries that a quantum network requires to compute several Boolean functions on f0;1gN in the black-box model. We show that, in the blackbox model, the ...