1994
- ▪W. Maass, G. Schnitger, E.D. Sontag, "A comparison of the computational power of sigmoid and Boolean threshold circuits", In Theoretical Advances in Neural Computation and Learning\/, pp. 127–151, 1994. pdf
Abstract
We examine the power of constant depth circuits with sigmoid threshold gates for computing boolean functions. 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 linear 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 linear threshold gates.
1991
- ▪W. Maass, G. Schnitger, E.D. Sontag, "On the computational power of sigmoid versus Boolean threshold circuits (extended abstract)", In Proceedings of the 32nd annual symposium on Foundations of computer science, pp. 767–776, 1991.