Papalocal
Loading…
Papalocal · Things
Work

Quine–McCluskey algorithm

Quine–McCluskey algorithm is an algorithm.

All 3 facts, and where they come from

Facts

3 facts · 0 confirmed by two sources · 0 cited · 3 from one source

What it is
algorithm One source
Named after
Edward J. McCluskey One source

Where this comes from

Papalocal keeps its own record. It started from these sources; what each one said is kept here as it was copied, so a change on their side never changes this page by itself. Tap one to read its version.

What Wikidata says · copied November 16, 2026 · revision 2230598703
Described as
algorithm
Other names
Quine-McCluskey algorithm
What it is
algorithm
Named after
Willard Van Orman Quine; Edward J. McCluskey
Wikipedias with a page
17

Wikidata item Q621409 (wikidata.org/wiki/Q621409), public domain (CC0). Copied 2026-11-16.

What Wikipedia says · copied November 16, 2026 · revision 1365841620

The Quine–McCluskey algorithm (QMC), also known as the method of prime implicants or the tabulation method, is a method used for minimization of Boolean functions that was developed by Willard V. Quine in 1952 and extended by Edward J. McCluskey in 1956. As a general principle this approach had already been demonstrated by the logician Hugh McColl in 1878, was proved by Archie Blake in 1937, and was rediscovered by Edward W. Samson and Burton E. Mills in 1954 and by Raymond J. Nelson in 1955. Also in 1955, Paul W. Abrahams and John G. Nordahl as well as Albert A. Mullin and Wayne G. Kellner proposed a decimal variant of the method.
The Quine–McCluskey algorithm is functionally identical to Karnaugh mapping, but the tabular form makes it more efficient for use in computer algorithms, and it also gives a deterministic way to check that the minimal form of a Boolean F has been reached.
The Quine-McCluskey algorithm works as follows:

Finding all prime implicants of the function.
Use those prime implicants in a prime implicant chart to find the essential prime implicants of the function, as well as other prime implicants that are necessary to cover the function.

From the Wikipedia article “Quine–McCluskey algorithm” (en.wikipedia.org/wiki/Quine–McCluskey_algorithm), by its contributors, under CC BY-SA 4.0 (creativecommons.org/licenses/by-sa/4.0/). Copied 2026-11-16; not changed.

Confirmed Two sources agree. Cited One source, and it names where it got it. One source One source, without a reference of its own. Sources disagree The sources disagree. We show the best-supported value and keep theirs below.

People connected 1

Known for it