Pages that link to "Item:Q1959388"
From MaRDI portal
The following pages link to Exact OBDD bounds for some fundamental functions (Q1959388):
Displaying 5 items.
- On the minimization of (complete) ordered binary decision diagrams (Q503467) (← links)
- De Bruijn sequences and complexity of symmetric functions (Q662186) (← links)
- The optimal read-once branching program complexity for the direct storage access function (Q963361) (← links)
- A simpler counterexample to a long-standing conjecture on the complexity of Bryant's apply algorithm (Q2445400) (← links)
- Exact OBDD Bounds for Some Fundamental Functions (Q5448645) (← links)