Decomposition of a system of incompletely specified Boolean functions defined with a binary decision diagram

DOI10.1134/S0005117914070017zbMath1325.94173OpenAlexW1982448916MaRDI QIDQ893916

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

zbMATH Keywords

decomposition methodbinary decision diagramsincompletely specified Boolean functions

Mathematics Subject Classification ID

Applications of graph theory to circuits and networks (94C15)

Cites Work

• Program realization of logical functions and automata. I: (Analysis and synthesis of binary programs)
• Ordered binary decision diagrams as knowledge-bases
• Graph-Based Algorithms for Boolean Function Manipulation
• Binary Decision Diagrams
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item