707 search results - page 104 / 142 » The Nonhomomorphicity of Boolean Functions |
139
click to vote
STOC
1996
ACM
15 years 10 months ago
1996
ACM
We study the complexity of computing Boolean functions using AND, OR and NOT gates. We show that a circuit of depth d with S gates can be made to output a constant by setting O(S1...
174
click to vote
ASPDAC
2009
ACM
16 years 8 days ago
2009
ACM
—Reversible logic studies have promising potential on energy lossless circuit design, quantum computation, nanotechnology, etc. Reversible logic features a one-to-one input outpu...
167
click to vote
SIAMCOMP
2010
15 years 4 months ago
2010
The classical direct product theorem for circuits says that if a Boolean function f : {0, 1}n → {0, 1} is somewhat hard to compute on average by small circuits, then the correspo...
172
click to vote
DC
2010
15 years 5 months ago
2010
Consider a distributed system N in which each agent has an input value and each communication link has a weight. Given a global function, that is, a function f whose value depends...
153
click to vote
CCS
2006
ACM
15 years 9 months ago
2006
ACM
Privacy-preserving protocols allow multiple parties with private inputs to perform joint computation while preserving the privacy of their respective inputs. An important cryptogr...