43 search results - page 4 / 9 » The Complexity of Depth-3 Circuits Computing Symmetric Boole... |
147
click to vote
STOC
2009
ACM
16 years 4 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...
130
click to vote
SIGECOM
2010
ACM
15 years 8 months ago
2010
ACM
We analyze the complexity of computing pure strategy Nash equilibria (PSNE) in symmetric games with a fixed number of actions. We restrict ourselves to “compact” representati...
122
Voted
COCO
2005
Springer
15 years 5 months ago
2005
Springer
We exhibit an explicitly computable ‘pseudorandom’ generator stretching l bits into m(l) = lΩ(log l) bits that look random to constant-depth circuits of size m(l) with log m...
136
click to vote
STOC
1993
ACM
15 years 7 months ago
1993
ACM
Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...
138
Voted
DAC
2008
ACM
16 years 4 months ago
2008
ACM
Boolean function bi-decomposition is a fundamental operation in logic synthesis. A function f(X) is bi-decomposable under a variable partition XA, XB, XC on X if it can be written...