Pages that link to "Item:Q4419798"
From MaRDI portal
The following pages link to The size of reduced OBDD's and optimal read-once branching programs for almost all Boolean functions (Q4419798):
Displaying 11 items.
- On the minimization of (complete) ordered binary decision diagrams (Q503467) (← links)
- Forms of representation for simple games: sizes, conversions and equivalences (Q898760) (← links)
- Efficient data structures for Boolean functions (Q1344625) (← links)
- On the evolution of the worst-case OBDD size (Q1607073) (← links)
- Randomized OBDD-based graph algorithms (Q1625606) (← links)
- Ordered binary decision diagrams and the Shannon effect (Q1878402) (← links)
- On the use of binary decision diagrams for solving problems on simple games (Q1926964) (← links)
- Better upper bounds on the QOBDD size of integer multiplication (Q2370421) (← links)
- Processing succinct matrices and vectors (Q2411035) (← links)
- A Fast Symbolic Transformation Based Algorithm for Reversible Logic Synthesis (Q3186608) (← links)
- Randomized OBDD-Based Graph Algorithms (Q3460720) (← links)
