On the number of threshold functions
Keyword(s):
AbstractA Boolean function is called a threshold function if its truth domain is a part of the n-cube cut off by some hyperplane. The number of threshold functions of n variables P(2, n) was estimated in [1, 2, 3]. Obtaining the lower bounds is a problem of special difficulty. Using a result of the paper [4], Zuev in [3] showed that for sufficiently large nP(2, n) > 2In the present paper a new proof which gives a more precise lower bound of P(2, n) is proposed, namely, it is proved that for sufficiently large nP(2, n) > 2
2014 ◽
Vol 25
(03)
◽
pp. 343-353
◽
Keyword(s):
2005 ◽
Vol DMTCS Proceedings vol. AE,...
(Proceedings)
◽
2002 ◽
Vol 2
(1)
◽
pp. 23-50
◽
Keyword(s):