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):
Displaying 35 items.
- On the OBDD representation of some graph classes (Q317396) (← links)
- On a class of decision diagrams (Q329079) (← links)
- On symbolic OBDD-based algorithms for the minimum spanning tree problem (Q443706) (← links)
- The size-cost of Boolean operations on constant height deterministic pushdown automata (Q443731) (← links)
- Counterexamples to the long-standing conjecture on the complexity of BDD binary operations (Q456068) (← links)
- On efficient implicit OBDD-based algorithms for maximal matchings (Q476163) (← links)
- Graph driven BDDs -- a new data structure for Boolean functions (Q673788) (← links)
- Polynomial-size binary decision diagrams for the exactly half-\(d\)-hyperclique problem reading each input bit twice (Q841618) (← links)
- Lower bounds on the OBDD size of two fundamental functions' graphs (Q845898) (← links)
- On the computational power of Boolean decision lists (Q853647) (← links)
- On the computational power of binary decision diagram with redundant variables. (Q960508) (← links)
- Representation of graphs by OBDDs (Q1003666) (← links)
- On the OBDD size for graphs of bounded tree- and clique-width (Q1011721) (← links)
- Complexity theoretical results on partitioned (nondeterministic) binary decision diagrams (Q1293553) (← 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)
- Infinitary relations and their representation. (Q1398672) (← links)
- A read-once lower bound and a \((1,+k)\)-hierarchy for branching programs (Q1575258) (← links)
- An improved hierarchy result for partitioned BDDs (Q1587372) (← 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 relation between BDDs and FDDs (Q1908345) (← links)
- On the relative succinctness of sentential decision diagrams (Q2322709) (← links)
- Symbolic topological sorting with OBDDs (Q2465997) (← links)
- Free binary decision diagrams for the computation of \(\text{EAR}_{ n }\) (Q2506164) (← links)
- Bounds on the OBDD-size of integer multiplication via universal hashing (Q2575837) (← links)
- On the structure of counterexamples to symmetric orderings for BDD's (Q2841260) (← links)
- On the Width of Ordered Binary Decision Diagrams (Q2942417) (← links)
- Randomization and nondeterminism are comparable for ordered read-once branching programs (Q4571952) (← links)
- A Theoretical and Numerical Analysis of the Worst-Case Size of Reduced Ordered Binary Decision Diagrams (Q4617985) (← links)
- Minimization of free BDDs (Q4788462) (← links)
- Characterizing the Complexity of Boolean Functions represented by Well-Structured Graph-Driven Parity-FBDDs (Q4800256) (← links)
- Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making (Q5463959) (← links)
