Jump to content

Talk:Quine–McCluskey algorithm

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Plugwash (talk | contribs) at 02:04, 26 December 2005 (deterministic?!). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

I am suffering difficulty in Digital Logic Design Please help me in this case

What are you having problems with? Kobold 20:58, 27 September 2005 (UTC)[reply]

deterministic?!

on the Karnaugh map page the following claim is made.

For expressions having more than four variables, the Quine-McCluskey algorithm, also called the method of prime implicants, should be used.
This algorithm uses a deterministic approach to simplification of boolean expressions. Thus, following the steps of this alternate algorithm ensures that the simplest expression can be found.
yet this algorithm (at least as described) does not nessacerally give a complete soloution, it leaves you with a list of essential prime implicants. If theese do not cover the equation it does not give a method for selecting which of the remaining prime implicants are to be used to get a minimal soloution. Plugwash 02:04, 26 December 2005 (UTC)[reply]
Retrieved from "https://en.wikipedia.org/w/index.php?title=Talk:Quine–McCluskey_algorithm&oldid=32726506"