Partitioning of Boolean functions by variable complementation

A method is presented which enables any Boolean function(s), defined on n variables, to be partitioned. Each partition so extracted is independent of a selected number of the defining variables, and hence each member of such a partition may be defined on the remaining variables. The method is applicable to logic-network synthesis, and its exhaustive application enables a fast implementation of the Quine-McCluskey1¿3 minimisation algorithm.