The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.12 - December (1971 vol.20)
pp: 1602-1605
C.R. Baugh , IEEE
ABSTRACT
Upper and lower bounds are derived for the number of pseudothreshold functions of n variables. (Pseudothershold logic is a generalization of threshold logic.) It is shown that a lower bound on the number of pseudothreshold functions P(n) of exactly n variables realized by zero-free structures is The number of pseudothreshold functions Q(n) of n variables realized by nontrivial structures is bounded by It is also proven that is a lower bound on the number of positive functions of exactly n variables.
INDEX TERMS
Bounds, positive functions, pseudothreshold functions, separable functions, threshold functions, threshold logic.
CITATION
C.R. Baugh, "Bounds on the Number of Pseudothreshold Functions", IEEE Transactions on Computers, vol.20, no. 12, pp. 1602-1605, December 1971, doi:10.1109/T-C.1971.223181
22 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool