Pages that link to "Item:Q456068"
From MaRDI portal
The following pages link to Counterexamples to the long-standing conjecture on the complexity of BDD binary operations (Q456068):
Displaying 5 items.
- Efficient symbolic search for cost-optimal planning (Q343909) (← links)
- Correctness and concurrent complexity of the black-white bakery algorithm (Q736464) (← links)
- A simpler counterexample to a long-standing conjecture on the complexity of Bryant's apply algorithm (Q2445400) (← links)
- 0/1 vertex and facet enumeration with BDDs (Q5233502) (← links)
- Fast enumeration of all cost-bounded solutions for combinatorial problems using ZDDs (Q6648288) (← links)