Decomposition of a system of incompletely specified Boolean functions defined with a binary decision diagram
From MaRDI portal
(Redirected from Publication:893916)
Recommendations
- Decomposition of systems of Boolean functions determined by binary decision diagrams
- Minimization of binary decision diagrams for systems of incompletely defined Boolean functions
- scientific article; zbMATH DE number 3433762
- Decomposing a system of Boolean functions into subsystems of connected functions
- Decomposability of partially defined Boolean functions
- Minimizing binary decision diagrams for systems of incompletely defined Boolean functions using algebraic cofactor expansions
- On Decomposition of Sub-definite Partial Boolean Functions
- A method for bi-decomposition of partial Boolean functions
- scientific article; zbMATH DE number 3910308
- Series parallel decomposition of a system of incompletely specified Boolean functions
Cites work
- scientific article; zbMATH DE number 3871193 (Why is no real title available?)
- scientific article; zbMATH DE number 1150567 (Why is no real title available?)
- scientific article; zbMATH DE number 3446405 (Why is no real title available?)
- Binary Decision Diagrams
- Functional decomposition with application to FPGA synthesis
- Graph-Based Algorithms for Boolean Function Manipulation
- Ordered binary decision diagrams as knowledge-bases
- Program realization of logical functions and automata. I: (Analysis and synthesis of binary programs)
- The art of computer programming. Volume 4A. Combinatorial algorithms. Part 1.
Cited in
(8)- scientific article; zbMATH DE number 3910308 (Why is no real title available?)
- Minimizing binary decision diagrams for systems of incompletely defined Boolean functions using algebraic cofactor expansions
- Series parallel decomposition of a system of incompletely specified Boolean functions
- Decomposition of systems of Boolean functions determined by binary decision diagrams
- Minimization of binary decision diagrams for systems of incompletely defined Boolean functions
- On decomposability and interaction 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 a system of incompletely specified Boolean functions defined with a binary decision diagram
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q893916)