Pages that link to "Item:Q987805"
From MaRDI portal
The following pages link to On the size of (generalized) OBDDs for threshold functions (Q987805):
Displaying 9 items.
- On the minimization of (complete) ordered binary decision diagrams (Q503467) (← links)
- Yet harder knapsack problems (Q653327) (← links)
- Lower bounds on the OBDD size of two fundamental functions' graphs (Q845898) (← links)
- On threshold BDDs and the optimal variable ordering problem (Q1016038) (← links)
- Size of ordered binary decision diagrams representing threshold functions (Q1390857) (← links)
- Lower Bounds for Testing Computability by Small Width OBDDs (Q3010413) (← links)
- Finding Small OBDDs for Incompletely Specified Truth Tables Is Hard (Q3591326) (← links)
- Asymptotically optimal bounds for OBDDs and the solution of some basic OBDD problems (Q5929919) (← links)
- Output-size sensitiveness of OBDD construction through maximal independent set problem (Q6085711) (← links)