Finding the optimal variable ordering for binary decision diagrams
From MaRDI portal
Publication:5375442
DOI10.1109/12.53586zbMath1395.68100OpenAlexW2157295479MaRDI QIDQ5375442
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
Related Items (13)
The complexity of minimizing and learning OBDDs and FBDDs ⋮ Better upper bounds on the QOBDD size of integer multiplication ⋮ Weighted \(A^*\) search - unifying view and application ⋮ Efficient data structures for Boolean functions ⋮ Binary Decision Diagrams ⋮ Ordered Binary Decision Diagrams and the Davis-Putnam procedure ⋮ Size of ordered binary decision diagrams representing threshold functions ⋮ Une approche intentionnelle du calcul des implicants premiers et essentiels des fonctions booléennes ⋮ On the size of binary decision diagrams representing Boolean functions ⋮ Minimization of decision trees is hard to approximate ⋮ Lazy regular sensing ⋮ Reordering decision diagrams for quantum computing is harder than you might think ⋮ The nonapproximability of OBDD minimization
This page was built for publication: Finding the optimal variable ordering for binary decision diagrams
