If the canonical sum for an n-input logic function is also a minimal sum, how many literals are in each product term of the sum? Might there be any other minimal sums in this case?
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.