Computational Complexity of Partitioned List Algorithms
暂无分享,去创建一个
[1] Willard Van Orman Quine,et al. The Problem of Simplifying Truth Functions , 1952 .
[2] Eugenio Morreale,et al. Partitioned List Algorithms for Prime Implicant Determination from Canonical Forms , 1967, IEEE Trans. Electron. Comput..
[3] Eugenio Morreale,et al. Computer Experience on Partitioned List Algorithms , 1970, IEEE Transactions on Computers.
[4] Gianfranco R. Putzolu,et al. Average Values of Quantities Appearing in Boolean Function Minimization , 1964, IEEE Trans. Electron. Comput..
[5] E. McCluskey. Minimization of Boolean functions , 1956 .
[6] Gianfranco R. Putzolu,et al. Statistical Complexity of Algorithms for Boolean Function Minimization , 1965, JACM.