Revision as of 20:58, 27 September 2005 edit Kobold (talk \| contribs) 53 edits No edit summary ← Previous edit		Revision as of 02:04, 26 December 2005 edit undo Plugwash (talk \| contribs) Extended confirmed users 9,427 edits deterministic?! Next edit →
Line 2: : What are you having problems with? [[User:Kobold\|Kobold]] 20:58, 27 September 2005 (UTC) == 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. [[User:Plugwash\|Plugwash]] 02:04, 26 December 2005 (UTC)

Talk:Quine–McCluskey algorithm: Difference between revisions