Pages that link to "Item:Q5375349"
From MaRDI portal
The following pages link to On the OBDD-representation of general Boolean functions (Q5375349):
Displayed 10 items.
- Efficient data structures for Boolean functions (Q1344625) (← links)
- Size of ordered binary decision diagrams representing threshold functions (Q1390857) (← links)
- On the evolution of the worst-case OBDD size (Q1607073) (← 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)
- On the error resilience of ordered binary decision diagrams (Q2354761) (← links)
- Better upper bounds on the QOBDD size of integer multiplication (Q2370421) (← links)
- Constructing small tree grammars and small circuits for formulas (Q2396826) (← links)
- Lifting for Simplicity: Concise Descriptions of Convex Sets (Q5044992) (← links)
- The size of reduced OBDDs and optimal read-once branching programs for almost all Boolean functions (Q6143981) (← links)