Name
Abstract | ||
|---|---|---|
New results are presented for the node complexity of threshold logic circuit implementations of n-input, m-output logic functions. When no restrictions are imposed on the network the node complexity is shown to be θ( m2 n (n− log m )) . One-hidden-layer networks are shown to have a node complexity of O(2 n + m) and θ( m 2 n [ n ( n + m )]) . Networks with weights restricted to the set {−1, 0, 1} are shown to have a node complexity of θ( m2 n ) , and networks for which fan-in is restricted to 2 are shown to have a node complexity of θ( m 2 n ( n + log m )) . |
Year | DOI | Venue |
|---|---|---|
1994 | 10.1016/0893-6080(94)90089-2 | Neural Networks |
Keywords | Field | DocType |
threshold logic,logic synthesis,neural network,neural networks,circuit complexity,node complexity,multilayer perceptrons | Logic synthesis,Discrete mathematics,Logic gate,Mathematical optimization,Circuit complexity,Algorithm,Artificial neural network,Mathematics | Journal |
Volume | Issue | ISSN |
7 | 9 | Neural Networks |
Citations | PageRank | References |
13 | 1.22 | 16 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bill G. Horne | 1 | 334 | 33.87 |
| Don R. Hush | 2 | 219 | 33.26 |