The main difficulty in finding minimal Boolean polynomials for given switching functions comes from the evaluation of the table of prime implicants. We show the following results: 1) Switching functions with “don't care”-points and those without yield essentially the same class of tables of prime implicants. 2) A polynomial, which is minimal with respect to the costfunction, which counts the entries of conjunctions and disjunctions, must not be a polynomial with a minimal number of prime… CONTINUE READING