论文信息 - Prime Implicants, Minimum Covers, and the Complexity of Logic Simplification

Prime Implicants, Minimum Covers, and the Complexity of Logic Simplification

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.

J. Shearer | Curtis T. McMullen

[1] Shahid H. Bokhari,et al. On the Mapping Problem , 1981, IEEE Transactions on Computers.

[2] Azriel Rosenfeld,et al. Parallel Image Processing Using Cellular Arrays , 1983, Computer.

[3] Christos A. Papachristou,et al. Characteristic measures of switching functions , 1977, Inf. Sci..

[4] Shahid H. Bokhari. Shuffle-exchanges on augmented meshes , 1984 .

[5] Saburo Muroga,et al. Logic design and switching theory , 1979 .

[6] H. F. Jordan. A Special Purpose Architecture for Finite Element Analysis , 1978 .

[7] Yoshihide Igarashi. An Improved Lower Bound on the Maximum Number of Prime Implicants , 1979 .

[8] Gianfranco R. Putzolu,et al. Average Values of Quantities Appearing in Boolean Function Minimization , 1964, IEEE Trans. Electron. Comput..

[9] N.R. Malik,et al. Graph theory with applications to engineering and computer science , 1975, Proceedings of the IEEE.

[10] A. L. Narasimha Reddy,et al. An Implementation of Mixed-Radix Conversion for Residue Number Applications , 1986, IEEE Transactions on Computers.