A note on the simulation of exponential threshold weights-Reference-Cited by-同舟云学术

A note on the simulation of exponential threshold weights

Published:1996 Issue: Volume: Page:136-141
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Hofmeister Thomas

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-61332-3_146.pdf

Reference4 articles.

1. M. Goldmann, J. Håstad, A. Razborov, Majority gates vs. general weighted threshold gates, Proceedings of 7th Annual Structure in Complexity Theory Conference (1992), pp. 2–13.

2. M. Goldmann, M. Karpinski, Simulating Threshold Circuits by Majority Circuits, STOC 1993, p. 551–560.

3. T. Hofmeister, Depth-efficient threshold circuits for arithmetic functions, Chap. 2 in: Theoretical Advances in Neural Computation and Learning, V. Roychowdhury, K-Y. Siu, and A. Orlitsky (eds.), Kluwer Academic Publ.

4. S. Muroga, Threshold logic and its applications, John Wiley, New York, 1971.

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

1. On Algebraic Constructions of Neural Networks with Small Weights;2022 IEEE International Symposium on Information Theory (ISIT);2022-06-26

2. A Short List of Equalities Induces Large Sign-Rank;SIAM Journal on Computing;2022-06

3. A #SAT Algorithm for Small Constant-Depth Circuits with PTF gates;Algorithmica;2022-01-07

4. Lower Bounds for Linear Decision Trees with Bounded Weights;Lecture Notes in Computer Science;2015

5. On the Complexity of Depth-2 Circuits with Threshold Gates;Mathematical Foundations of Computer Science 2005;2005