For each i-set (MV-input, binary output)
nTwo-level: Espresso-MV
wminimize an i-set with a don’t care.
wa don’t care is an input for which the output can be any value.
nTwo-Level: ISOP (Minato)
wFast method to build a cover of cubes of an i-set from MDD of function and MDD of don’t cares (method of Minato extended to MV).
All i-sets at once
n Quine-McCluskey type ND
minimization
wGiven a ND relation, generate a cover of all i-sets such that the total number of cubes is minimum.