Minimization of free BDDs

DOI10.1016/S0167-9260(02)00041-XMaRDI QIDQ4788462zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Wolfgang Günther, Rolf Drechsler

Publication date 22 January 2003

Published in Integration (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0167-9260(02)00041-x

zbMATH Keywords

BDDsdata structuresfree BDDslogic synthesis

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Recommendations

• The complexity of minimizing FBDDs. (Extended abstract)
• scientific article; zbMATH DE number 1948534
• On the size of binary decision diagrams representing Boolean functions
• Efficient algorithms for the transformation between different types of binary decision diagrams
• A comparison of free BDDs and transformed BDDs

Cited in

(5)

• Efficient algorithms for the transformation between different types of binary decision diagrams
• Binary decision diagrams
• Efficient algorithms for the transformation between different types of binary decision diagrams
• The complexity of minimizing FBDDs. (Extended abstract)
• A comparison of free BDDs and transformed BDDs

This page was built for publication: Minimization of free BDDs

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