Pages that link to "Item:Q5375442"
From MaRDI portal
The following pages link to Finding the optimal variable ordering for binary decision diagrams (Q5375442):
Displaying 13 items.
- On the size of binary decision diagrams representing Boolean functions (Q673087) (← links)
- Weighted \(A^*\) search - unifying view and application (Q840833) (← links)
- Efficient data structures for Boolean functions (Q1344625) (← links)
- Size of ordered binary decision diagrams representing threshold functions (Q1390857) (← links)
- The complexity of minimizing and learning OBDDs and FBDDs (Q1613429) (← links)
- The nonapproximability of OBDD minimization (Q1854498) (← links)
- Reordering decision diagrams for quantum computing is harder than you might think (Q2097418) (← links)
- Better upper bounds on the QOBDD size of integer multiplication (Q2370421) (← links)
- Minimization of decision trees is hard to approximate (Q2475411) (← links)
- Binary Decision Diagrams (Q3176365) (← links)
- Une approche intentionnelle du calcul des implicants premiers et essentiels des fonctions booléennes (Q4362281) (← links)
- Ordered Binary Decision Diagrams and the Davis-Putnam procedure (Q5096299) (← links)
- Lazy regular sensing (Q6175512) (← links)
