15033 search results - page 286 / 3007 » Complexity Theory and Algorithms |
173
click to vote
FOCS
1998
IEEE
15 years 9 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 ...
136
Voted
STOC
1996
ACM
15 years 9 months ago
1996
ACM
In this paper we prove a perhaps unexpected relationship between the complexity class of the boolean functions that have linear size circuits, and n-party private protocols. Speci...
137
click to vote
RAS
2002
15 years 4 months ago
2002
In this paper, we present a framework for a robotic system with the ability to perform real-world manipulation tasks. The complexity of such tasks determines the precision and fre...
135
click to vote
IJCM
2010
15 years 3 months ago
2010
Recognizable transductions constitute a proper subclass of rational transductions, characterized by the well-known Mezei’s Theorem. We propose a family of transducers which refl...
173
click to vote
JAIR
2010
15 years 3 months ago
2010
Decentralized planning in uncertain environments is a complex task generally dealt with by using a decision-theoretic approach, mainly through the framework of Decentralized Parti...