Pages that link to "Item:Q1364133"
From MaRDI portal
The following pages link to A reducibility concept for problems defined in terms of ordered binary decision diagrams (Q1364133):
Displaying 4 items.
- Some properties of space-bounded synchronized alternating Turing machines with universal states only (Q1184994) (← links)
- Hardness of indentifying the minimum ordered binary decision diagram (Q1841888) (← links)
- A reducibility concept for problems defined in terms of ordered binary decision diagrams (Q5047173) (← links)
- Chain reduction for binary and zero-suppressed decision diagrams (Q5919614) (← links)