Abstract:
A class of minimization algorithms for Boolean functions that involve conjunctions from a reduced disjunctive normal form and first-order neighborhoods of such conjunctions is investigated. A particular algorithm is selected that is the best in the class in many cases.
Key words:minimization of Boolean functions, local algorithms, information-computing algorithms, majorant algorithms.