Pages that link to "Item:Q1357805"
From MaRDI portal
The following pages link to Efficient algorithms for the transformation between different types of binary decision diagrams (Q1357805):
Displaying 6 items.
- Deterministic identity testing for sum of read-once oblivious arithmetic branching programs (Q1686835) (← links)
- A unifying approach to edge-valued and arithmetic transform decision diagrams (Q1778578) (← links)
- The nonapproximability of OBDD minimization (Q1854498) (← links)
- Approximate algorithms for minimization of binary decision diagrams on the basis of linear transformations of variables (Q2487684) (← links)
- Properties of Switch-List Representations of Boolean Functions (Q5130011) (← links)
- (Q5414587) (← links)