Decomposing a system of Boolean functions into subsystems of connected functions
From MaRDI portal
Publication:2290478
Recommendations
- Decomposition of systems of Boolean functions determined by binary decision diagrams
- Decomposition of a system of incompletely specified Boolean functions defined with a binary decision diagram
- Series parallel decomposition of a system of incompletely specified Boolean functions
- Experimental comparison of decomposition methods for systems of Boolean function
- Decomposition of Boolean functions applying the apparatus of Boolean derivatives
Cites work
Cited in
(8)- Experimental comparison of decomposition methods for systems of Boolean function
- An input variable partitioning algorithm for functional decomposition of a system of Boolean functions based on the tabular method
- A new approach to the decomposition of Boolean functions by the method of q-partitions. III: Joint decomposition of a function system
- Sequential decomposition of the Boolean function: search for a suitable partition on a set of arguments
- Decomposition of systems of Boolean functions determined by binary decision diagrams
- Series parallel decomposition of a system of incompletely specified Boolean functions
- Methods for decomposition of Boolean functions: algorithms, quality indices, and applications
- Decomposition of a system of incompletely specified Boolean functions defined with a binary decision diagram
This page was built for publication: Decomposing a system of Boolean functions into subsystems of connected functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2290478)