1 |
G. Boole, An Investigation of the Laws of Thought, London: Macmillan, at the Internet Archive, 1854.
|
2 |
R.E. Bryant, "Graph‐based Algorithms for Boolean Functions Manipulation," IEEE Trans.Computers, vol. C‐35, pp. 677-691, Aug. 1986.
DOI
|
3 |
O. Coudert, "Doing Two‐Level Logic Minimization 100 Times Faster," in Proceeding SODA '95 Proceedings of the sixth annual ACM‐SIAM symposium on Discrete algorithms
|
4 |
M. Karnaugh, "A map method for synthesis of combinational logic circuits," Transactions of the AIEE, Communications and Electronics, vol 72, pp. 593-599, 1953.
|
5 |
H. Mahmoud, "A New Method for Two‐Level Logic Minimization," in 46th IEEE International Midwest Symposium on Circuits and Systems, Magdy Bayoumi (Chairman), Cairo, Egypt, December 2003.
|
6 |
E. J. McCluskey, "Minimization of Booleanfunctions," Bell System Tech. Journal,Vol. 35, No. 5, pp. 1417-1444, 1956.
DOI
|
7 |
P. C. McGeer, J. Sanghavi, R.K. Brayton,A.L.Sangiovanni‐Vincentelli, "ESPRESSOSIGNATURE: A New Exact Minimizer for Logic Functions," IEEE Transactions on VLSI , vol. 1, no. 4, pp. 432-440, December 1993.
DOI
|
8 |
C. H. Roth, Jr., Fundamentals of Logic Design, 5th ed, Thomson Engineering, 2004.
|
9 |
R. L. Rudell, "Multiple‐Valued Logic Minimization for PLA Synthesis," Memorandum No. UCB/ERL M86-65 (Berkeley), 1986.
|
10 |
C. E. Shannon, "A Symbolic Analysis of Relay and Switching Circuits," Trans. AIEE. pp 713-723, 1957.
|