1695 search results - page 57 / 339 » Linear, Polynomial or Exponential |
125
click to vote
FOCS
1998
IEEE
15 years 5 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 ...
112
Voted
IANDC
2006
15 years 24 days ago
2006
This paper studies the complexity of learning classes of expressions in propositional logic from equivalence queries and membership queries. In particular, we focus on bounding th...
109
click to vote
JSC
2006
15 years 23 days ago
2006
In statistics, mixture models consisting of several component subpopulations are used widely to model data drawn from heterogeneous sources. In this paper, we consider maximum lik...
112
click to vote
SPAA
2005
ACM
15 years 6 months ago
2005
ACM
We study the problem of asymptotically reducing the runtime of serial computations with circuits of polynomial size. We give an algorithmic size-depth tradeoff for parallelizing ...
117
Voted
ATAL
2005
Springer
15 years 6 months ago
2005
Springer
One of the difficulties to adapt MDPs for the control of cooperative multi-agent systems, is the complexity issued from Decentralized MDPs. Moreover, existing approaches can not ...