Publications de l'Institut Mathématique, Nouvelle Série Vol. 82(96), pp. 129–134 (2007) 

AN ENUMERATIVE PROBLEM IN THRESHOLD LOGICZana Kovijanic VukicevicPrirodnomatematicki fakultet, 81000 Podgorica, p.p. 211, MontenegroAbstract: The number of Boolean threshold functions is investigated. A new lower bound on the number of $n$dimensional threshold functions on a set $\{0,1,\ldots,K1\}$ is given. Classification (MSC2000): 05A16; 94C10 Full text of the article: (for faster download, first choose a mirror)
Electronic fulltext finalized on: 20 Feb 2008. This page was last modified: 26 Feb 2008.
© 2008 Mathematical Institute of the Serbian Academy of Science and Arts
