Word.ws English Dictionary

Quine-McCluskey algorithm

Quine-McCluskey algorithm proper noun: 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.

Proper noun

the 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.

Origin of Quine-McCluskey algorithm

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

Questions about Quine-McCluskey algorithm

What does Quine-McCluskey algorithm mean?
Quine-McCluskey algorithm means 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.
What part of speech is Quine-McCluskey algorithm?
Quine-McCluskey algorithm is a proper noun.

Words near Quine-McCluskey algorithm in the dictionary

  1. quine
  2. Quine dagger
  3. Quine daggers
  4. Quine quote
  5. Quine quotes
  6. Quine-McCluskey algorithm
  7. Quine-Putnam indispensability argument
  8. Quinean
  9. Quineanism
  10. quined
  11. quinela

Source and license

Adapted from Wiktionary: Quine-McCluskey algorithm (page history and authors). Text available under the Creative Commons Attribution-ShareAlike 4.0 license. Word.ws reformatted the entry and added links. Wiktionary data of 2026-09-02.

Last updated:

Cite this entry: “Quine-McCluskey algorithm.” Word.ws, https://word.ws/quine-mccluskey_algorithm. Based on Wiktionary, CC BY-SA 4.0.