This web page contains the abstract of my paper:
"Prime Implicants, Minimum Covers and the Complexity of Logic Simplification" with C. McMullen, IEEE Transactions on Computers, c-35(1986), p. 761-762.
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 2**m-1 implicants but no more.
IBM Research home page |
James B. Shearer's home page |
[ IBM home page | Order | Search | Contact IBM | Help | (C) | (TM) ]