612 search results - page 32 / 123 » Hardness assumptions in the foundations of theoretical compu... |
FOCS
1989
IEEE
13 years 11 months ago
1989
IEEE
In this paper, Boolean functions in ,4C0 are studied using harmonic analysis on the cube. The main result is that an ACO Boolean function has almost all of its “power spectrum”...
CCS
2008
ACM
13 years 9 months ago
2008
ACM
We present FairplayMP (for "Fairplay Multi-Party"), a system for secure multi-party computation. Secure computation is one of the great achievements of modern cryptograp...
ACSC
2004
IEEE
13 years 11 months ago
2004
IEEE
A framework is a reusable design that requires software components to function. To instantiate a framework, a software engineer must provide the software components required by th...
TCS
2012
12 years 3 months ago
2012
In Sensor Networks, the lack of topology information and the availability of only one communication channel has led research work to the use of randomization to deal with collisio...
STOC
2009
ACM
14 years 8 months ago
2009
ACM
We consider the following question: given a two-argument boolean function f, represented as an N ? N binary matrix, how hard is to determine the (deterministic) communication comp...