Series parallel decomposition of a system of incompletely specified Boolean functions
From MaRDI portal
Recommendations
- 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 3910308
- Decomposition of Boolean functions applying the apparatus of Boolean derivatives
- Decomposing a system of Boolean functions into subsystems of connected functions
Cited in
(11)- Decomposing a system of Boolean functions into subsystems of connected functions
- Event-based functional decomposition
- An iterative method for linear decomposition of index generating functions
- A comparison of modified reconstructability analysis and Ashenhurst‐Curtis decomposition of Boolean functions
- Generation of universal series-parallel Boolean functions
- scientific article; zbMATH DE number 3910308 (Why is no real title available?)
- scientific article; zbMATH DE number 4025344 (Why is no real title available?)
- Efficient algorithmic decomposition of transistor groups into series, bridge, and parallel combinations
- scientific article; zbMATH DE number 589878 (Why is no real title available?)
- Synthesis of combinational circuits by means of bi-decomposition of Boolean functions
- Decomposition of a system of incompletely specified Boolean functions defined with a binary decision diagram
This page was built for publication: Series parallel decomposition of a system of incompletely specified Boolean functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5147349)
