AngouriMath
Cover(System.Collections.Generic.List{AngouriMath.Functions.Boolean.Minimiser.Implicant},System.Collections.Generic.List{System.Int32})
Method (no overloads)
Summary
A cover of the minterms by the prime implicants: every implicant that alone covers
some minterm has to be in it, and what those leave uncovered is taken greedily,
widest first.
some minterm has to be in it, and what those leave uncovered is taken greedily,
widest first.
Remarks
Greedy rather than Petrick's method, which is exact and exponential in the number
of implicants. The essential pass alone settles every case inwork/boolmin ,
and where it does not, a cover that is one term wider than the optimum still has to
beat every other candidate on node count before `Simplify` will return it.
of implicants. The essential pass alone settles every case in
and where it does not, a cover that is one term wider than the optimum still has to
beat every other candidate on node count before `Simplify` will return it.
Angouri © 2019-2023 · Project's repo · Site's repo · Octicons · Transparency · 1953 pages online