Pages that link to "Item:Q5054808"
From MaRDI portal
The following pages link to On the hardness of approximating the minimum consistent OBDD problem (Q5054808):
Displaying 10 items.
- Introduction to the OBDD algorithm for the ATP community (Q1332638) (← 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)
- Minimization problems for parity OBDDs (Q2272213) (← links)
- Minimization of decision trees is hard to approximate (Q2475411) (← links)
- On the hardness of approximating the minimum consistent acyclic DFA and decision diagram. (Q2583554) (← links)
- Finding Small OBDDs for Incompletely Specified Truth Tables Is Hard (Q3591326) (← links)
- (Q4941907) (← links)
- Output-size sensitiveness of OBDD construction through maximal independent set problem (Q6085711) (← links)