About: Quine–McCluskey algorithm

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Quine–McCluskey algorithm Goto Sponge NotDistinct Permalink

An Entity of Type : dbo:Software, within Data Space : el.dbpedia.org associated with source document(s)

The Quine–McCluskey algorithm (QMC), also known as the method of prime implicants, 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.

Attributes	Values
rdf:type	software
rdfs:label	Quine–McCluskey algorithm (en)
rdfs:comment	The Quine–McCluskey algorithm (QMC), also known as the method of prime implicants, 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. (en)
sameAs	Quine–McCluskey algorithm
dbp:wikiPageUsesTemplate	dbt:Anchor dbt:Cite_arXiv dbt:Cite_book dbt:Cite_journal dbt:Cite_web dbt:ISBN dbt:Mono dbt:Reflist dbt:Sdash dbt:Short_description dbt:Sub dbt:Update_inline dbt:Use_dmy_dates dbt:Use_list-defined_references dbt:Ya
foaf:homepage	http://embedded.com
Subject	Boolean algebra Willard Van Orman Quine
gold:hypernym	Method
prov:wasDerivedFrom	http://en.wikipedia.org/wiki/Quine–McCluskey_algorithm?oldid=1068540429&ns=0
Wikipage page ID	317263 (xsd:integer)
page length (characters) of wiki page	35000 (xsd:nonNegativeInteger)
Wikipage revision ID	1068540429 (xsd:integer)
has abstract	The Quine–McCluskey algorithm (QMC), also known as the method of prime implicants, 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 function has been reached. It is sometimes referred to as the tabulation method. The method involves two steps: 1. * Finding all prime implicants of the function. 2. * 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. (en)
foaf:isPrimaryTopicOf	http://en.wikipedia.org/wiki/Quine–McCluskey_algorithm
is notableIdea of	Willard Van Orman Quine
is Wikipage redirect of	Caldwell's decimal tabulation Caldwell's decimal tabulation for obtaining prime implicants Method of prime implicants Q-M method McCluskey's method McCluskey-Quine algorithm McCluskey method McCluskey–Quine algorithm Quine's method Quine's second method Quine's ﬁrst method Quine-McCluskey Tabular Method Quine-McCluskey algorithm Quine-McCluskey method Quine-McCluskey method of reduction Quine-McCluskey tabular method Quine-McCluskey technique Quine-mcluscky Quine mcluscky Quine mcluskey Quine mclusky Quine method Quine–McCluskey Quine–McCluskey Tabular Method Quine–McCluskey method Quine–McCluskey method of reduction Quine–McCluskey tabular method Quine–McCluskey technique Quinne's method Quinne-McCluskey Quinne-McCluskey algorithm Quinne-McCluskey method Quinne-McCluskey technique Quinne–McCluskey Quinne–McCluskey algorithm Quinne–McCluskey method Quinne–McCluskey technique Quine-McCluskey Quine McCluskey
is Link from a Wikipage to another Wikipage of	Logic optimization Logic redundancy Logic synthesis Blake canonical form Boolean algebra (structure) Boolean function Buchberger's algorithm Caldwell's decimal tabulation Caldwell's decimal tabulation for obtaining prime implicants Digital data Disjunctive normal form Don't-care term History of CAD software Method of prime implicants Hugh MacColl Computer Pioneer Award Computer engineering compendium Conjunctive normal form Edward J. McCluskey John Alan Robinson List of algorithms Implicant Index of philosophy articles (I–Q) Karnaugh map Espresso heuristic logic minimizer McCluskey's method McCluskey-Quine algorithm McCluskey method McCluskey–Quine algorithm
is known for of	Edward J. McCluskey

Faceted Search & Find service v1.17_git151 as of Feb 20 2025

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Nov 11 2024, on Linux (x86_64-ubuntu_focal-linux-gnu), Single-Server Edition (72 GB total memory, 1 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software