Decomposition of a system of incompletely specified Boolean functions defined with a binary decision diagram
From MaRDI portal
Publication:893916
DOI10.1134/S0005117914070017zbMATH Open1325.94173OpenAlexW1982448916MaRDI QIDQ893916FDOQ893916
Authors: P. N. Bibilo 
Publication date: 23 November 2015
Published in: Automation and Remote Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0005117914070017
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
- Graph-Based Algorithms for Boolean Function Manipulation
- The art of computer programming. Volume 4A. Combinatorial algorithms. Part 1.
- Title not available (Why is that?)
- Binary Decision Diagrams
- Functional decomposition with application to FPGA synthesis
- Program realization of logical functions and automata. I: (Analysis and synthesis of binary programs)
- Ordered binary decision diagrams as knowledge-bases
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (8)
- Minimization of binary decision diagrams for systems of incompletely defined Boolean functions
- Decomposing a system of Boolean functions into subsystems of connected functions
- A method for bi-decomposition of partial Boolean functions
- Title not available (Why is that?)
- Decomposition of systems of Boolean functions determined by binary decision diagrams
- Series parallel decomposition of a system of incompletely specified Boolean functions
- On decomposability and interaction functions
- Minimizing binary decision diagrams for systems of incompletely defined Boolean functions using algebraic cofactor expansions
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)
