468 search results - page 43 / 94 » One-Way Functions in Complexity Theory |
131
click to vote
JETAI
2007
15 years 4 months ago
2007
Reasoning, problem solving, indeed the general process of acquiring knowledge, is not an isolated, homogenous affair involving a one agent using a single form of representation, b...
176
click to vote
PODS
2012
ACM
13 years 6 months ago
2012
ACM
Data is increasingly being bought and sold online, and Webbased marketplace services have emerged to facilitate these activities. However, current mechanisms for pricing data are ...
188
click to vote
SIAMCOMP
2011
14 years 11 months ago
2011
Abstract. In the 2nd Annual FOCS (1961), Chao-Kong Chow proved that every Boolean threshold function is uniquely determined by its degree-0 and degree-1 Fourier coefficients. These...
163
click to vote
FOCS
1998
IEEE
15 years 8 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 ...
124
click to vote
STOC
1996
ACM
15 years 8 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...