Results 1 -
1 of
1
On the size of weights for threshold gates
- SIAM Journal on Discrete Mathematics
, 1994
"... 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. ..."
Abstract
-
Cited by 44 (0 self)
- Add to MetaCart
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.
