On the Circuit Complexity of Sigmoid Feedforward Neural Networks-Reference-Cited by-同舟云学术

On the Circuit Complexity of Sigmoid Feedforward Neural Networks

Published:1996-10 Issue:7 Volume:9 Page:1155-1171
ISSN:0893-6080
Container-title:Neural Networks
language:en
Short-container-title:Neural Networks

Author:

Beiu Valeriu,Taylor John G.

Publisher

Elsevier BV

Subject

Artificial Intelligence,Cognitive Neuroscience

Reference58 articles.

1. Abu-Mostafa, Y. (1989). Complexity in neural systems. In C.A. Mead (Ed.), Analog VLSI and neural systems (pp. 353–358). Reading, MA: Addison Wesley.

2. Albrecht, A. (1992). On bounded-depth threshold circuits for pattern functions. In Proceedings of the International Conference on Artificial Neural Networks ICANN'92, Brighton, UK (pp. 135–138). Amsterdam: Elsevier Science.

3. The monotone circuit complexity of Boolean functions;Alon;Combinatorica,1987

4. Alon, N., & Bruck, J. (1991). Explicit construction of depth-2 majority circuits for comparison and addition. (IBM Technical Report RJ 8300 (75661)). San Jose, CA: IBM Almaden Research Center (to appear in SIAM Journal of Discrete Mathematics).

5. A comparison study of binary feedforward neural networks and digital circuits;Andree;Neural Networks,1993

Cited by 16 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. ReLU neural networks of polynomial size for exact maximum flow computation;Mathematical Programming;2024-05-25

2. What Formal Languages Can Transformers Express? A Survey;Transactions of the Association for Computational Linguistics;2024

3. ReLU Neural Networks of Polynomial Size for Exact Maximum Flow Computation;Integer Programming and Combinatorial Optimization;2023

4. Non–von Neumann multi-input spike signal processing enabled by an artificial synaptic multiplexer;Science Advances;2022-06-24

5. Neural Network Circuits and Parallel Implementations;Neural Networks and Statistical Learning;2019