ABSTRACT
For an arbitrary n, there are 2n monomial terms in n variables, and a boolean
function is a sum of a subset of those monomials. Therefore, there are a total
of 22 n
different boolean functions, as shown in Table B.1 where
( n
t
) is the
number of different ways to choose t objects from a set of n different objects.
