Minimization of Boolean Functions

By N. Biswas. 1971

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Improving Robot Controller Transparency Through Autonomous Policy Explanation (2017, methodology): “Once the region is expressed as a logical formula, our approach calls for application of the Quine-McCluskey algorithm [25, 17] (Algorithm 1, line 16) to perform Boolean logic minimization on the collection of minterms in f .”
Provably-Secure Logic Locking: From Theory To Practice (2017, methodology): “e problem then is nding minimum cubes that collectively cover each cube in Cinit ; this is the classical problem of minimum-cube cover in 2-level logic optimization [30], and any synthesis tool can be utilized to solve this problem.”
Principles in the Evolutionary Design of Digital Circuits—Part I (2004, methodology): “The Quine-McCluskey algorithm Quine, 1952; McCluskey, 1956 is an exhaustive search method which essentially formalizes the operations used for simplifying a function in a Karnaugh map.”
Quantifier Elimination and Cylindrical Algebraic Decomposition (2004, methodology): “with VLSI synthesis (Bartholomeus and Man 1985; Brayton et al. 1984; Hong et al. 1974; McCluskey 1956; Quine 1952, 1955, 1959; Rudell 1986; Sasao 1982; Simanyi 1983) producing several efficient algorithms such as MINI, POP, Presto, ESPRESSO, ESPRESSO-MV, etc.”
Efficient Büchi Automata from LTL Formulae (2000, background): “Our definitio of direct simulation corresponds to that ofBSR-aaof [6].”