Absolute minimization of completely specified switching functions
- 1 January 1991
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 40 (1) , 53-65
- https://doi.org/10.1109/12.67320
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- Minimal covering problem and PLA minimizationInternational Journal of Parallel Programming, 1985
- A New Technique for the Fast Minimization of Switching FunctionsIEEE Transactions on Computers, 1977
- MINI: A Heuristic Approach for Logic MinimizationIBM Journal of Research and Development, 1974
- A New Algorithm for Generating Prime ImplicantsIEEE Transactions on Computers, 1970
- Generalization of Consensus Theory and Application to the Minimization of Boolean FunctionsIEEE Transactions on Electronic Computers, 1967
- The problem of simplifying logical expressionsThe Journal of Symbolic Logic, 1959
- Irredundant Disjunctive and Conjunctive Forms of a Boolean FunctionIBM Journal of Research and Development, 1957
- Minimization of Boolean Functions*Bell System Technical Journal, 1956
- A Topological Method for the Determination of the Minimal Forms of a Boolean FunctionIEEE Transactions on Electronic Computers, 1956
- The map method for synthesis of combinational logic circuitsTransactions of the American Institute of Electrical Engineers, Part I: Communication and Electronics, 1953