An Algorithm for the Automatic Approximate Minimization of Boolean Functions
暂无分享,去创建一个
[1] Mark B. Wells,et al. Aspects of Language Design for Combinatorial Computing , 1964, IEEE Trans. Electron. Comput..
[2] J. Paul Roth,et al. Algorithms for logical design , 1961, Transactions of the American Institute of Electrical Engineers, Part I: Communication and Electronics.
[3] Bernard Harris. An Algorithm for Determining Minimal Representations of a Logic Function , 1957, IRE Trans. Electron. Comput..
[4] Fabrizio Luccio. A Method for the Selection of Prime Implicants , 1966, IEEE Trans. Electron. Comput..
[5] S. R. Das,et al. Computing irredundant normal forms from abbreviated presence functions , 1966, IEEE Trans. Electron. Comput..
[6] E. McCluskey. Minimization of Boolean functions , 1956 .
[7] Nicolae N. Necula. A Numerical Procedure for Determination of the Prime Implicants of a Boolean Function , 1967, IEEE Trans. Electron. Comput..
[8] J. Roth. Algebraic topological methods for the synthesis of switching systems. I , 1958 .