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

Previous Article

Next Article

Contents of this Issue

Other Issues

ELibM Journals

ELibM Home

EMIS Home

Pick a mirror

 		 

AN ENUMERATIVE PROBLEM IN THRESHOLD LOGIC

Zana Kovijanic Vukicevic

Prirodno-matematicki fakultet, 81000 Podgorica, p.p. 211, Montenegro

Abstract: 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,K-1\}$ 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
© 2008 ELibM and FIZ Karlsruhe / Zentralblatt MATH for the EMIS Electronic Edition