Pages that link to "Item:Q2942417"
From MaRDI portal
The following pages link to On the Width of Ordered Binary Decision Diagrams (Q2942417):
Displaying 10 items.
- On the minimization of (complete) ordered binary decision diagrams (Q503467) (← links)
- On the size of binary decision diagrams representing Boolean functions (Q673087) (← links)
- Testing computability by width-two OBDDs (Q764366) (← 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)
- On the width of regular classes of finite structures (Q2305404) (← links)
- Ordered binary decision diagrams and minimal trellises (Q4571421) (← links)
- Second-Order Finite Automata (Q5042226) (← links)