Pages that link to "Item:Q503467"

The following pages link to On the minimization of (complete) ordered binary decision diagrams (Q503467):

Displaying 17 items.

• Complexity theoretical results on partitioned (nondeterministic) binary decision diagrams (Q1293553) (← links)
• A reducibility concept for problems defined in terms of ordered binary decision diagrams (Q1364133) (← links)
• Optimal ordered binary decision diagrams for read-once formulas (Q1570838) (← links)
• The complexity of minimizing and learning OBDDs and FBDDs (Q1613429) (← links)
• Hardness of indentifying the minimum ordered binary decision diagram (Q1841888) (← links)
• The nonapproximability of OBDD minimization (Q1854498) (← links)
• Second-order finite automata (Q2158302) (← links)
• Minimization problems for parity OBDDs (Q2272213) (← links)
• On the Width of Ordered Binary Decision Diagrams (Q2942417) (← links)
• Optimization Bounds from Binary Decision Diagrams (Q2962554) (← links)
• Ordered binary decision diagrams and minimal trellises (Q4571421) (← links)
• Minimization of Word-Level Decision Diagrams (Q4788457) (← links)
• (Q4941907) (← links)
• Second-Order Finite Automata (Q5042226) (← links)
• On the descriptive and algorithmic power of parity ordered binary decision diagrams (Q5047172) (← links)
• A reducibility concept for problems defined in terms of ordered binary decision diagrams (Q5047173) (← links)
• Chain reduction for binary and zero-suppressed decision diagrams (Q5919614) (← links)