An Enumerative Problem in Threshold Logic
Publications de l'Institut Mathématique, _N_S_82 (2007) no. 96, p. 129
Cet article a éte moissonné depuis la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts
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.
@article{10_2298_PIM0796129K,
author = {\v{Z}ana Kovijani\'c Vuki\'cevi\'c},
title = {An {Enumerative} {Problem} in {Threshold} {Logic}},
journal = {Publications de l'Institut Math\'ematique},
pages = {129 },
year = {2007},
volume = {_N_S_82},
number = {96},
doi = {10.2298/PIM0796129K},
zbl = {1250.05020},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.2298/PIM0796129K/}
}
Žana Kovijanić Vukićević. An Enumerative Problem in Threshold Logic. Publications de l'Institut Mathématique, _N_S_82 (2007) no. 96, p. 129 . doi: 10.2298/PIM0796129K
Cité par Sources :