A Prime Implicant Algorithm with Factoring
暂无分享,去创建一个
[1] Richard B. Worrell,et al. Efficient Ordering of Set Expressions for Symbolic Expansion , 1973, JACM.
[2] Willard Van Orman Quine,et al. A Way to Simplify Truth Functions , 1955 .
[3] Robert W. House,et al. A Generalization of Nelson's Algorithm for Obtaining Prime Implicants , 1965, J. Symb. Log..
[4] S. R. Das. Comments on "A New Algorithm for Generating Prime Implicants" , 1971, IEEE Trans. Computers.
[5] Raymond J. Nelson,et al. Simplest normal truth functions , 1955, Journal of Symbolic Logic.
[6] S. R. Das,et al. Maxterm Type Expressions of Switching Functions and Their Prime Implicants , 1965, IEEE Trans. Electron. Comput..
[7] Richard C. T. Lee,et al. A New Algorithm for Generating Prime Implicants , 1970, IEEE Transactions on Computers.
[8] Willard Van Orman Quine,et al. The Problem of Simplifying Truth Functions , 1952 .
[9] A. Scheinman. A method for simplifying Boolean functions , 1962 .
[10] Pierre L. Tison,et al. Generalization of Consensus Theory and Application to the Minimization of Boolean Functions , 1967, IEEE Trans. Electron. Comput..
[11] Sunil R. Das,et al. Clause-Column Table Approach for Generating All the Prime Implicants of Switching Functions , 1972, IEEE Transactions on Computers.