An Enumerative Problem in Threshold Logic


Žana Kovijanić Vukićević


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.