MINI: A Heuristic Approach for Logic Minimization

DOI10.1147/RD.185.0443MaRDI QIDQ4777256zbMATH OpenOpenAlexFDO

Authors Se June Hong, R. G. Cain, Daniel L. Ostapko

Publication date 1974

Published in IBM Journal of Research and Development (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1147/rd.185.0443

Mathematics Subject Classification ID

Classical propositional logic (03B05) Software, source code, etc. for problems pertaining to mathematical logic and foundations (03-04)

Cited in

(7)

• A purely map procedure for two-level multiple-output logic minimization
• A continuous approach to inductive inference
• Partially unate Boolean functions: properties of their sum-of-products representations
• Polynomial-time algorithms for generation of prime implicants
• Study of the complexity of an algorithm to derive the complement of a binary function
• Logic design of decoded-programmable logic arrays
• Compact DSOP and partial DSOP forms

This page was built for publication: MINI: A Heuristic Approach for Logic Minimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4777256)