Pages that link to "Item:Q1390857"
From MaRDI portal
The following pages link to Size of ordered binary decision diagrams representing threshold functions (Q1390857):
Displaying 17 items.
- Yet harder knapsack problems (Q653327) (← links)
- On the size of binary decision diagrams representing Boolean functions (Q673087) (← links)
- Forms of representation for simple games: sizes, conversions and equivalences (Q898760) (← links)
- On the size of (generalized) OBDDs for threshold functions (Q987805) (← links)
- On threshold BDDs and the optimal variable ordering problem (Q1016038) (← links)
- Binary decision diagrams for generating and storing non-dominated project portfolios with interval-valued project scores (Q1753430) (← links)
- Ordered binary decision diagrams and the Shannon effect (Q1878402) (← links)
- Non-clausal redundancy properties (Q2055860) (← links)
- Compact representation of near-optimal integer programming solutions (Q2191768) (← links)
- Theoretical insights and algorithmic tools for decision diagram-based optimization (Q2398513) (← links)
- On the Width of Ordered Binary Decision Diagrams (Q2942417) (← links)
- SIZES OF ORDERED DECISION TREES (Q3021963) (← links)
- On the OBDD Complexity of Threshold Functions and the Variable Ordering Problem (Q3599068) (← links)
- On random orderings of variables for parity ordered binary decision diagrams (Q4487092) (← links)
- Size of OBDD representation of 2-level redundancies functions (Q5941091) (← links)
- Clausal proofs for pseudo-Boolean reasoning (Q6535573) (← links)
- Fast enumeration of all cost-bounded solutions for combinatorial problems using ZDDs (Q6648288) (← links)
