14699 search results - page 260 / 2940 » Complexity and Cognitive Computing |
141
click to vote
FOCS
2003
IEEE
15 years 9 months ago
2003
IEEE
The degree of a polynomial representing (or approximating) a function f is a lower bound for the quantum query complexity of f. This observation has been a source of many lower bo...
132
click to vote
FOCS
1998
IEEE
15 years 8 months ago
1998
IEEE
Sampling is an important primitive in probabilistic and quantum algorithms. In the spirit of communication complexity, given a function f : X
120
click to vote
FOCS
1991
IEEE
15 years 7 months ago
1991
IEEE
Karchmer, Raz, and Wigderson, 1991, discuss the circuit depth complexity of n bit Boolean functions constructed by composing up to d = logn=loglogn levels of k = logn bit boolean
138
click to vote
GD
2009
Springer
15 years 7 months ago
2009
Springer
We show that recognizing intersection graphs of convex sets has the same complexity as deciding truth in the existential theory of the reals. Comparing this to similar results on t...
144
click to vote
DAGSTUHL
2006
15 years 5 months ago
2006
Generalizing earlier work characterizing the quantum query complexity of computing a function of an unknown classical "black box" function drawn from some set of such bl...