Talk:Quine–McCluskey algorithm: Difference between revisions

Content deleted Content added
Line 96:
::It can be shown that for a function of ''n'' variables the upper bound on the number of prime implicants is 3<sup>''n''</sup>/''n''. If ''n'' = 32 there may be over 6.5 * 10<sup>15</sup>, prime implicants.
For ''n'' = 32 we have 3<sup>''n''</sup>/''n'' &asymp; 5.79&times;10<sup>13</sup>, which is about 112 times less than 6.5&times;10<sup>15</sup>.
:::"It can be show", so either show it, or cite the proof.
 
Which value is correct then? --[[User:CiaPan|CiaPan]] 06:50, 13 September 2007 (UTC)