Pages that link to "Item:Q5096910"

The following pages link to On the complexity of constructing optimal ordered binary decision diagrams (Q5096910):

Displaying 12 items.

• Complexity theoretical results on partitioned (nondeterministic) binary decision diagrams (Q1293553) (← 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)
• 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)
• 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)
• (Q5121904) (← links)
• ON OBDD-BASED ALGORITHMS AND PROOF SYSTEMS THAT DYNAMICALLY CHANGE THE ORDER OF VARIABLES (Q5148102) (← links)
• (Q5414587) (← links)