Quine-McCluskey type ND relation minimization

Given an ND relation, e.g.
the complete flexibility,
its **i-set** is the set
of input minterms that **can** produce
output value *i*.

Generate for each i-set all its primes, *P**i
*

Form covering table with one column for each *p**j* in *P**i* for all *i
*

One row for each minterm in the input space

Solve minimum covering problem

Primes chosen from each *P**i** *is the
cover for each i-set.