Content deleted Content added
m SatyrBot auto-adding tag to talk page. See User:SatyrBot/Current project |
→Complexity: question |
||
Line 1:
{{Logic2}}
Line 77 ⟶ 76:
The article should explain why the algorithm works as it demonstrates it with the example.
== Complexity ==
Please check this:
::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'' ≈ 5.79×10<sup>13</sup>, which is about 112 times less than 6.5×10<sup>15</sup>.
Which value is correct then? --[[User:CiaPan|CiaPan]] 06:50, 13 September 2007 (UTC)
| |||