Exact minimization of binary decision diagrams using implicit techniques

DOI10.1109/12.736442MaRDI QIDQ4571488zbMATH OpenOpenAlexWikidataFDO

Authors Arlindo L. Oliveira, Luca P. Carloni, Tiziano Villa, Alberto L. Sangiovanni-Vincentelli

Publication date 9 July 2018

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/12.736442

Mathematics Subject Classification ID

Data structures (68P05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cited in

(6)

• scientific article; zbMATH DE number 6292613 (Why is no real title available?)
• Hardness of indentifying the minimum ordered binary decision diagram
• Optimization Bounds from Binary Decision Diagrams
• scientific article; zbMATH DE number 6999904 (Why is no real title available?)
• Chain reduction for binary and zero-suppressed decision diagrams
• Minimization of Word-Level Decision Diagrams

This page was built for publication: Exact minimization of binary decision diagrams using implicit techniques

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4571488)