Finding the optimal variable ordering for binary decision diagrams

DOI10.1109/12.53586MaRDI QIDQ5375442zbMATH OpenOpenAlexFDO

Authors Steven J. Friedman, Kenneth J. Supowit

Publication date 14 September 2018

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

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

Mathematics Subject Classification ID

Data structures (68P05)

Cited in

(14)

• The complexity of minimizing and learning OBDDs and FBDDs
• Quantum algorithm for finding the optimal variable ordering for binary decision diagrams
• Efficient data structures for Boolean functions
• Weighted A^* search - unifying view and application
• Ordered binary decision diagrams and the Davis-Putnam procedure
• Binary decision diagrams
• On the size of binary decision diagrams representing Boolean functions
• Minimization of decision trees is hard to approximate
• Better upper bounds on the QOBDD size of integer multiplication
• Lazy regular sensing
• Une approche intentionnelle du calcul des implicants premiers et essentiels des fonctions booléennes
• The nonapproximability of OBDD minimization
• Size of ordered binary decision diagrams representing threshold functions
• Reordering decision diagrams for quantum computing is harder than you might think

This page was built for publication: Finding the optimal variable ordering for binary decision diagrams

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