Pages that link to "Item:Q673788"
From MaRDI portal
The following pages link to Graph driven BDDs -- a new data structure for Boolean functions (Q673788):
Displaying 25 items.
- Parity OBDDs cannot be handled efficiently enough (Q293348) (← links)
- Knowledge compilation meets database theory: compiling queries to decision diagrams (Q359877) (← links)
- A very simple function that requires exponential size nondeterministic graph-driven read-once branching programs (Q1007589) (← links)
- The symbolic OBDD scheme for generating mechanical assembly sequences (Q1028726) (← links)
- AND/OR search spaces for graphical models (Q1028898) (← links)
- Completeness and non-completeness results with respect to read-once projections (Q1271310) (← links)
- Efficient data structures for Boolean functions (Q1344625) (← links)
- BDDs -- design, analysis, complexity, and applications. (Q1428568) (← links)
- On the evolution of the worst-case OBDD size (Q1607073) (← links)
- Lower bounds for linearly transformed OBDDs and FBDDs (Q1608325) (← links)
- The complexity of minimizing and learning OBDDs and FBDDs (Q1613429) (← links)
- Formal verification based on Boolean expression diagrams (Q1954165) (← links)
- Minimization problems for parity OBDDs (Q2272213) (← links)
- On the relative succinctness of sentential decision diagrams (Q2322709) (← links)
- Lower bounds for restricted read-once parity branching programs (Q2503280) (← links)
- Boolean expression diagrams (Q2506489) (← links)
- Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication (Q2508966) (← links)
- A very simple function that requires exponential size read-once branching programs. (Q2583538) (← links)
- Restricted Nondeterministic Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication (Q2771493) (← links)
- On the Complexity of the Hidden Weighted Bit Function for Various BDD Models (Q4265532) (← links)
- On the Tractable Counting of Theory Models and its Application to Truth Maintenance and Belief Revision (Q4443390) (← links)
- Complexity Theoretical Results on Nondeterministic Graph-driven Read-Once Branching Programs (Q4462678) (← links)
- Characterizing the Complexity of Boolean Functions represented by Well-Structured Graph-Driven Parity-FBDDs (Q4800256) (← links)
- On the relation between BDDs and FDDs (Q5096325) (← links)
- (Q5228561) (← links)
