Issue No. 06 - June (1989 vol. 38)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.24296
The authors show that the problem of obtaining a minimum complete test set is NP-complete for monotone PLAs even when each product term of the PLA contains at most two literals. Using the ideas developed in the proof of this result, they resolve an open question due to B. Krishnamurthy and S.B. Akers (1984). The authors also show that given a complete test set T, the problem of obtaining a mini
complexity; minimum test sets; monotone combinational circuits; minimum complete test set; monotone PLAs; literals; NP-complete; combinatorial circuits; computational complexity; logic arrays; logic testing.
S. Chakravarty, D. Rosenkrantz, H. Hunt, III and S. Ravi, "The Complexity of Generating Minimum Test Sets for PLA's and Monotone Combinational Circuits," in IEEE Transactions on Computers, vol. 38, no. , pp. 865-869, 1989.