Efficient Threshold Circuits for Power Series

Abstract We show that functions with convergent real power series can be well approximated by two classes of polynomial-size small-weight threshold circuits: depth-three circuits with threshold gates on all levels and depth-four circuits with threshold gates on the first two levels and AND–OR gates on the last two. This is done without restricting the input to a fixed closed subinterval of the interval of convergence of the series. We also point out that rational functions and the logarithm of x in base b can be well approximated by the same classes of circuits when both x and b are given as input.

[1]  J. Reif,et al.  On Threshold Circuits and Polynomial Computation , 1992, SIAM J. Comput..

[2]  Denis Thérien,et al.  Threshold Circuits of Small Majority-Depth , 1998, Inf. Comput..

[3]  Jehoshua Bruck,et al.  Depth efficient neural networks for division and related problems , 1993, IEEE Trans. Inf. Theory.

[4]  Pavel Pudlák,et al.  Threshold circuits of bounded depth , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[5]  Pekka Orponen,et al.  Computational complexity of neural networks: a survey , 1994 .

[6]  Kai-Yeung Siu,et al.  On Optimal Depth Threshold Circuits for Multiplication and Related Problems , 1994, SIAM J. Discret. Math..

[7]  Robert Gardner,et al.  Introduction To Real Analysis , 1994 .

[8]  Andrew Chi-Chih Yao,et al.  ON ACC and threshold circuits , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[9]  Stephen A. Cook,et al.  Log Depth Circuits for Division and Related Problems , 1986, SIAM J. Comput..