Quine-McCluskey algorithm

From Wiktionary, the free dictionary
Jump to navigation Jump to search



It was developed by Willard V. Quine and extended by Edward J. McCluskey.

Proper noun[edit]

Quine-McCluskey algorithm

  1. A method for minimization of Boolean functions, functionally identical to Karnaugh mapping, but having a tabular form that is more efficient in computer algorithms. It is based on finding prime implicants.