Revision as of 00:15, 12 October 2005 edit Skryskalla (talk \| contribs) 5 edits m fixed broken link ← Previous edit		Revision as of 11:08, 16 November 2005 edit undo 128.195.80.242 (talk) No edit summary Next edit →
Line 1: '''Quine-McCluskey algorithm''' is a method used for ~~minimisation~~minimization of [[Boolean function]]s. It is functionally identical to [[Karnaugh map\|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. The method involves two steps:

Quine–McCluskey algorithm: Difference between revisions