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.

Ask AI about this wordChatGPTClaudePerplexityGoogle AIGrok

Meanings

proper nounthe 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

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

Full word history & related roots →
Cite this entry
APA

Quine-McCluskey algorithm. (n.d.). In WatkinsX Dictionary. Retrieved November 4, 2026, from https://dictionary.watkinsx.com/word/Quine-McCluskey%20algorithm

MLA

“Quine-McCluskey algorithm.” WatkinsX Dictionary, https://dictionary.watkinsx.com/word/Quine-McCluskey%20algorithm. Accessed November 4, 2026.

Chicago

WatkinsX Dictionary, s.v. “Quine-McCluskey algorithm,” accessed November 4, 2026, https://dictionary.watkinsx.com/word/Quine-McCluskey%20algorithm.

Source: Quine-McCluskey algorithm on Wiktionary, CC BY-SA 4.0.