Pages that link to "Item:Q1854498"
From MaRDI portal
The following pages link to The nonapproximability of OBDD minimization (Q1854498):
Displaying 15 items.
- Linear temporal logic symbolic model checking (Q465680) (← links)
- On the minimization of (complete) ordered binary decision diagrams (Q503467) (← links)
- Weighted \(A^*\) search - unifying view and application (Q840833) (← links)
- Representation of graphs by OBDDs (Q1003666) (← links)
- Introduction to the OBDD algorithm for the ATP community (Q1332638) (← links)
- Optimal ordered binary decision diagrams for read-once formulas (Q1570838) (← links)
- The complexity of minimizing and learning OBDDs and FBDDs (Q1613429) (← links)
- Ordered binary decision diagrams and the Shannon effect (Q1878402) (← links)
- Minimization problems for parity OBDDs (Q2272213) (← links)
- Nondeterministic unitary OBDDs (Q2399370) (← links)
- Symbolic graphs: Linear solutions to connectivity related problems (Q2471809) (← links)
- Minimization of decision trees is hard to approximate (Q2475411) (← links)
- Finding Small OBDDs for Incompletely Specified Truth Tables Is Hard (Q3591326) (← links)
- On the hardness of approximating the minimum consistent OBDD problem (Q5054808) (← links)
- Output-size sensitiveness of OBDD construction through maximal independent set problem (Q6085711) (← links)