Pages that link to "Item:Q1613429"
From MaRDI portal
The following pages link to The complexity of minimizing and learning OBDDs and FBDDs (Q1613429):
Displaying 9 items.
- On the minimization of (complete) ordered binary decision diagrams (Q503467) (← links)
- A reducibility concept for problems defined in terms of ordered binary decision diagrams (Q1364133) (← links)
- The nonapproximability of OBDD minimization (Q1854498) (← links)
- Minimization problems for parity OBDDs (Q2272213) (← links)
- Minimization of decision trees is hard to approximate (Q2475411) (← links)
- On the influence of the variable ordering for algorithmic learning using OBDDs (Q2568437) (← links)
- An efficient query learning algorithm for ordered binary decision diagrams (Q2568438) (← links)
- (Q4941907) (← links)
- On the hardness of approximating the minimum consistent OBDD problem (Q5054808) (← links)