ANewTechnique fortheFastMinimization ofSwitching Functions
V. Thomasrhyne, Melvin H. Mckinney, Udow . Pooch · 1977
The minimization ofswitching functions involving many variables isadifficult task. This paper presents a new mini- mization procedure thatallows this processtobeimplemented with reduced computational effort. Thisprocedure, designated asthe directed-search algorithm, isapplicable tobothmanualandcom- puter-programmed minimization. Thedetails ofthealgorithm are presented andillustrated byexample. Comparative run-times be- tweenanother minimization programandthedirected-search al- gorithm, asimplemented inFortran, arealsogiven. IndexTerms-Minimization ofBoolean functions, primeim- plicants, row dominance, search tree,switching algebra.