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.
Keywords :
Boolean functions, integer programming, NPN equivalence classes, pseudothreshold functions, representative functions, unate functions.; Boolean functions; Computer science; Helium; Linear programming; Logic gates; Logic programming; Mathematical model; Telephony; Terminology; Upper bound; Boolean functions, integer programming, NPN equivalence classes, pseudothreshold functions, representative functions, unate functions.;
