On the size of weights for threshold gates (1994)
Cached
Download Links
- [www.csc.kth.se]
- [www.nada.kth.se]
- [http.nada.kth.se]
- DBLP
Other Repositories/Bibliography
by
Johan Hastad
| Venue: | SIAM Journal on Discrete Mathematics |
| Citations: | 44 - 0 self |
BibTeX
@ARTICLE{Hastad94onthe,
author = {Johan Hastad},
title = {On the size of weights for threshold gates},
journal = {SIAM Journal on Discrete Mathematics},
year = {1994},
pages = {484--492}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We provethatifn is a power of 2 then there is a threshold function that on n inputs that requires weights of size around 2 (n log n)=2;n. This almost matches the known upper bounds.
Citations
| 1530 | Introduction to the theory of neural computation - Hertz, Krogh - 1991 |
| 80 | Majority gates vs. general weighted threshold gates - Goldmann, HËšastad, et al. - 1992 |
| 67 | Thershold Logic - Lewis, Coates - 1967 |
| 29 | Threshold logic and its applications. Wiley-Interscience - Muroga - 1994 |
| 9 | The Computational and Learning Complexity of Neural Networks - Parberry - 1994 |
| 3 | A lower bound of the number of threshold functions - Yajima, Ibaraki - 1965 |
| 2 | Bounds on the number of threshold functions - Smith - 1966 |
| 1 | Neural networks and complexity theory (invited talk - Orponen - 1992 |
| 1 | A Orlisky, and Kailath T. A geometric approach to threshold circuit complexity - Roychowdhury, Siu - 1991 |
