On the Design of Universal Boolean Functions
F. P. Preparata · IEEE Transactions on Computers · 1971
A Boolean function U( z1,...,zm) is universal for given n≥1 and a set I of variables if it realizes all Boolean functions f(x1,..., xn) by substituting for each zj a variable of I. Designs of universal Boolean functions for various specifications of I are considered for the practical cases of n<10. Assuming the number m of input terminals as criterion of simplicity, the designs obtained are the best known to be offered by a systematic procedure for the same specifications.