22 search results - page 1 / 5 » Size and Energy of Threshold Circuits Computing Mod Function... |
MFCS
2009
Springer
13 years 11 months ago
2009
Springer
Let C be a threshold logic circuit computing a Boolean function MODm : {0, 1}n → {0, 1}, where n ≥ 1 and m ≥ 2. Then C outputs “0” if the number of “1”s in an input ...
CJTCS
1999
13 years 4 months ago
1999
We show that thepermanent cannot be computed by uniform constantdepth threshold circuits of size Tn, for any function T such that for all k, Tk n = o2n. More generally, we show th...
FCT
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. In the paper we show that there is a close relationship between the energy complexity and the depth of threshold circuits computing any Boolean function although they hav...
ECCC
2006
13 years 4 months ago
2006
Abstract. Circuits composed of threshold gates (McCulloch-Pitts neurons, or perceptrons) are simplified models of neural circuits with the advantage that they are theoretically mor...
IPL
2006
13 years 4 months ago
2006
Weighted threshold functions with positive weights are a natural generalization of unweighted threshold functions. These functions are clearly monotone. However, the naive way of ...