Minimizing a Boolean function by means of an index spectrum

摘要

A description is given of a test for performance in implementing Boolean functions that is rapidly computable, together with a suitable algorithm and a decomposition method of defining the shortest DNF, which does not require a solution to the covering problem.