Talk:Quine–McCluskey algorithm: Difference between revisions

Revision as of 15:13, 26 August 2014

Revision as of 15:21, 26 August 2014

Line 103:

If ''prime implicant'' refers to an irreducible sum of products term, and any boolean function of ''n'' variables can be written in less than 2^''n'' SOP terms, then then the upper bound of prime implicants is less than 2^''n'', since the number of reduced terms is always less than or equal to the number of outputs of a boolean function(which has 2^''n'' outputs). This means that either the complexity section of the article is either using incorrect terms (in which case ''implicants'' is meant, rather than ''prime implicants''), is grossly inaccurate, or should be clarified. [[User:Dany001|Dany001]] ([[User talk:Dany001|talk]]) 02:06, 10 July 2010 (UTC)

:Once prime implicants are known , one minimal set of prime implicants can be easily obtained by using a simple method described in " Efficient minimisation of Boolean functions " , V C Prasad , International journal of Electrical engineering Education , Oct.2008, pp.321-326 . <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/203.106.57.104|203.106.57.104]] ([[User talk:203.106.57.104|talk]]) 04:11, 23 May 2011 (UTC)</span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot-->

== Where did the stars come from? ==