Issue No. 12 - December (1972 vol. 21)

ISSN: 0018-9340

pp: 1373-1379

C.R. Baugh , Bell Telephone Laboratories, Inc.

ABSTRACT

An algorithm is described which generates the set of representative functions of the negation and/or permutation of variables and negation of the function (NPN) equivalence classes of unate Boolean functions. The algorithm is based upon integer programming techniques. The set of representative functions for the NPN equivalence classes of unate functions of six or fewer variables was obtained using this algorithm. The set of pseudothreshold functions of six or fewer variables was also tabulated by using this algorithm as a basis.

INDEX TERMS

Boolean functions, integer programming, NPN equivalence classes, pseudothreshold functions, representative functions, unate functions.

CITATION

C. Baugh, "Generation of Representative Functions of the NPN Equivalence Classes of Unate Boolean Functions," in

*IEEE Transactions on Computers*, vol. 21, no. , pp. 1373-1379, 1972.

doi:10.1109/T-C.1972.223509

CITATIONS

SEARCH