14774 search results - page 458 / 2955 » Computational complexity and evolutionary computation |
171
click to vote
FOCS
1998
IEEE
15 years 11 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
183
click to vote
GD
2009
Springer
15 years 10 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...
193
click to vote
DAGSTUHL
2006
15 years 8 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...
168
click to vote
MFCS
2005
Springer
16 years 10 days ago
2005
Springer
This paper analyses the computational complexity of the model checking problem for Higher Order Fixpoint Logic – the modal µ-calculus enriched with a typed λ-calculus. It is ha...
173
click to vote
STACS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We prove that, for any arbitrary finite alphabet and for the uniform distribution over deterministic and accessible automata with n states, the average complexity of Moo...