Minimization of binary decision diagrams for systems of incompletely defined Boolean functions

DOI10.1134/S106423071306004XMaRDI QIDQ2017631zbMATH OpenFDO

Authors P. N. Bibilo

Publication date 23 March 2015

Published in Journal of Computer and Systems Sciences International (Search for Journal in Brave)

Mathematics Subject Classification ID

Applications of graph theory to circuits and networks (94C15)

Recommendations

• Minimizing binary decision diagrams for systems of incompletely defined Boolean functions using algebraic cofactor expansions
• Decomposition of a system of incompletely specified Boolean functions defined with a binary decision diagram
• Decomposition of systems of Boolean functions determined by binary decision diagrams
• scientific article; zbMATH DE number 4139681
• Approximate algorithms for minimization of binary decision diagrams on the basis of linear transformations of variables

Cites work

• scientific article; zbMATH DE number 1150567 (Why is no real title available?)
• A Numerical Expansion Technique and Its Application to Minimal Multiplexer Logic Circuits
• Binary Decision Diagrams
• Decomposition of systems of Boolean functions determined by binary decision diagrams
• Graph-Based Algorithms for Boolean Function Manipulation
• Ordered binary decision diagrams as knowledge-bases
• Software implementation of logic functions and automata. II. Computation time of binary programs
• The art of computer programming. Volume 4A. Combinatorial algorithms. Part 1.

Cited in

(14)

• A note on depth minimization of Boolean systems
• scientific article; zbMATH DE number 2084329 (Why is no real title available?)
• Experimental study of algorithms for minimization of binary decision diagrams using algebraic representations of cofactors
• Hardware implementation of code converters designed to reduce the length of binary encoded words
• Hardness of indentifying the minimum ordered binary decision diagram
• Using Decision Trees to Derive the Complement of a Binary Function with Multiple-Valued Inputs
• Approximate algorithms for minimization of binary decision diagrams on the basis of linear transformations of variables
• On the size of binary decision diagrams representing Boolean functions
• Decomposition of a system of incompletely specified Boolean functions defined with a binary decision diagram
• Minimizing binary decision diagrams for systems of incompletely defined Boolean functions using algebraic cofactor expansions
• Decomposition of systems of Boolean functions determined by binary decision diagrams
• Synthesis of Minimal Binary Decision Trees
• Minimization of Word-Level Decision Diagrams
• ESCT minimization for incompletely specified functions

Describes a project that uses

Uses Software

• ModelSim

This page was built for publication: Minimization of binary decision diagrams for systems of incompletely defined Boolean functions

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