Pages that link to "Item:Q673087"
From MaRDI portal
The following pages link to On the size of binary decision diagrams representing Boolean functions (Q673087):
Displayed 19 items.
- On the OBDD representation of some graph classes (Q317396) (← links)
- On symbolic OBDD-based algorithms for the minimum spanning tree problem (Q443706) (← links)
- On efficient implicit OBDD-based algorithms for maximal matchings (Q476163) (← links)
- Graph driven BDDs -- a new data structure for Boolean functions (Q673788) (← links)
- Lower bounds on the OBDD size of two fundamental functions' graphs (Q845898) (← links)
- Representation of graphs by OBDDs (Q1003666) (← links)
- On the OBDD size for graphs of bounded tree- and clique-width (Q1011721) (← links)
- On the complexity of analysis and manipulation of Boolean functions in terms of decision graphs (Q1330665) (← links)
- Efficient data structures for Boolean functions (Q1344625) (← links)
- A read-once lower bound and a \((1,+k)\)-hierarchy for branching programs (Q1575258) (← links)
- On the evolution of the worst-case OBDD size (Q1607073) (← links)
- Lower bounds for linearly transformed OBDDs and FBDDs (Q1608325) (← links)
- On the descriptive and algorithmic power of parity ordered binary decision diagrams (Q1854421) (← links)
- Ordered binary decision diagrams and the Shannon effect (Q1878402) (← links)
- On the relative succinctness of sentential decision diagrams (Q2322709) (← links)
- Symbolic topological sorting with OBDDs (Q2465997) (← links)
- Bounds on the OBDD-size of integer multiplication via universal hashing (Q2575837) (← links)
- Randomization and nondeterminism are comparable for ordered read-once branching programs (Q4571952) (← links)
- Characterizing the Complexity of Boolean Functions represented by Well-Structured Graph-Driven Parity-FBDDs (Q4800256) (← links)