Abstract:
We show that any Boolean function f which can be expressed in a sum-of-products form using m product terms can contain as many as 2m− 1 implicants but no more.Metadata
Abstract:
We show that any Boolean function f which can be expressed in a sum-of-products form using m product terms can contain as many as 2m− 1 implicants but no more.
Published in: IEEE Transactions on Computers ( Volume: C-35, Issue: 8, August 1986)
