The following pages link to (Q4542178):
Displaying 9 items.
- Worst case examples for operations on OBDDs (Q294746) (← links)
- String-matching with OBDDs (Q596086) (← links)
- Graph driven BDDs -- a new data structure for Boolean functions (Q673788) (← links)
- BDDs -- design, analysis, complexity, and applications. (Q1428568) (← links)
- Ordered binary decision diagrams as knowledge-bases (Q1605409) (← links)
- On the error resilience of ordered binary decision diagrams (Q2354761) (← links)
- A simpler counterexample to a long-standing conjecture on the complexity of Bryant's apply algorithm (Q2445400) (← links)
- New aspects in optimization of BDDs: mixed techniques based on polulations of solutions and lower bound (Q2922720) (← links)
- Asymptotically optimal bounds for OBDDs and the solution of some basic OBDD problems (Q5929919) (← links)
