On the computational power of sigmoid versus Boolean thresholdcircuits
Maass, W.
Schnitger, G.
Sontag, E.D.
Inst. for Inf. Process. Graz, Graz Univ. of Technol.;
This paper appears in: Foundations of Computer Science, 1991. Proceedings., 32nd Annual Symposium on
Publication Date: 1-4 Oct 1991
On page(s): 767-776
Meeting Date: 10/01/1991 - 10/04/1991
Location: San Juan, Puerto Rico
ISBN: 0-8186-2445-0
References Cited: 11
INSPEC Accession Number: 4253930
Digital Object Identifier: 10.1109/SFCS.1991.185447
Current Version Published: 2002-08-06
Abstract
The power of constant depth circuits with sigmoid (i.e., smooth)
threshold gates for computing Boolean functions is examined. It is shown
that, for depth 2, constant size circuits of this type are strictly more
powerful than constant size Boolean threshold circuits (i.e., circuits
with Boolean threshold gates). On the other hand it turns out that, for
any constant depth d, polynomial size sigmoid threshold
circuits with polynomially bounded weights compute exactly the same
Boolean functions as the corresponding circuits with Boolean threshold
gates
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
