Category:Quine-McCluskey algorithm
From LiteratePrograms
The Quine-McCluskey algorithm is a two-level logic minimization method. It takes a boolean formula and attempts to reduce it to an equivalent, more succinct boolean formula. For example, suppose A, B and C are boolean variables, and the logical negation of X is written as 
. Then we could reduce this boolean formula f:
To this equivalent formula:
This boolean formula minimization problem is also solved by Karnaugh maps, but in a less systematic and scalable way.
