Decomposition of systems of Boolean functions determined by binary decision diagrams
From MaRDI portal
Recommendations
- Decomposition of a system of incompletely specified Boolean functions defined with a binary decision diagram
- Decomposing a system of Boolean functions into subsystems of connected functions
- Binary-decision-diagram-based decomposition of Boolean functions into reversible logic elements
- Decomposition of Boolean functions
- A decomposition of Boolean functions
- The Decomposition Tree for analyses of Boolean functions
- Decomposition of multi-output Boolean functions
- Minimization of binary decision diagrams for systems of incompletely defined Boolean functions
- Experimental comparison of decomposition methods for systems of Boolean function
Cites work
- scientific article; zbMATH DE number 3910308 (Why is no real title available?)
- scientific article; zbMATH DE number 1150567 (Why is no real title available?)
- Binary Decision Diagrams
- Dedicated spectral method of Boolean function decomposition
- Functional decomposition with application to FPGA synthesis
- Graph-Based Algorithms for Boolean Function Manipulation
Cited in
(19)- Decomposition of Boolean functions applying the apparatus of Boolean derivatives
- Decomposition of multi-output Boolean functions
- BDD-based decompositions of multiple output logic functions
- Synthesis of combinational circuits by means of bi-decomposition of Boolean functions
- scientific article; zbMATH DE number 3910308 (Why is no real title available?)
- 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
- scientific article; zbMATH DE number 1775529 (Why is no real title available?)
- Series parallel decomposition of a system of incompletely specified Boolean functions
- Methods for decomposition of Boolean functions: algorithms, quality indices, and applications
- A new approach to the decomposition of Boolean functions by the method of \(q\)-partitions. I: Separating decomposition of full and partial functions
- Experimental comparison of decomposition methods for systems of Boolean function
- Minimization of binary decision diagrams for systems of incompletely defined Boolean functions
- An input variable partitioning algorithm for functional decomposition of a system of Boolean functions based on the tabular method
- scientific article; zbMATH DE number 4021162 (Why is no real title available?)
- Algebraic decomposition of discrete functions
- A method for bi-decomposition of partial Boolean functions
- Decomposing a system of Boolean functions into subsystems of connected functions
This page was built for publication: Decomposition of systems of Boolean functions determined by binary decision diagrams
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q353738)
