Minimum parameter solution of switching equations

A new procedure is presented for solving equations in the two-valued Boolean algebra. The method has the advantage of expressing a general solution using the minimum number of binary parameters. The method guarantees that the complete set of all particular solutions can be generated from this general solution by assigning each parameter a value of either 0 or 1. The technique is presented using Karnaugh maps, but could easily be implemented in software.<
>