Graph driven BDDs -- a new data structure for Boolean functions
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3594626 (Why is no real title available?)
- scientific article; zbMATH DE number 512863 (Why is no real title available?)
- Binary Decision Diagrams
- Binary decision tree test functions
- Equivalence of free Boolean graphs can be decided probabilistically in polynomial time
- Graph-Based Algorithms for Boolean Function Manipulation
- On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication
- On the size of binary decision diagrams representing Boolean functions
- Polynomial size \(\Omega\)-branching programs and their computational power
- Reduction of OBDDs in linear time
Cited in
(31)- On the relative succinctness of sentential decision diagrams
- Completeness and non-completeness results with respect to read-once projections
- Suggestion for a new representation for binary function
- Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication
- Complexity Theoretical Results on Nondeterministic Graph-driven Read-Once Branching Programs
- A very simple function that requires exponential size read-once branching programs.
- A very simple function that requires exponential size nondeterministic graph-driven read-once branching programs
- scientific article; zbMATH DE number 1834649 (Why is no real title available?)
- scientific article; zbMATH DE number 1775052 (Why is no real title available?)
- The symbolic OBDD scheme for generating mechanical assembly sequences
- The size of reduced OBDDs and optimal read-once branching programs for almost all Boolean functions
- On the relation between BDDs and FDDs (extended abstract)
- On the Tractable Counting of Theory Models and its Application to Truth Maintenance and Belief Revision
- Knowledge compilation meets database theory: compiling queries to decision diagrams
- Minimization problems for parity OBDDs
- Characterizing the Complexity of Boolean Functions represented by Well-Structured Graph-Driven Parity-FBDDs
- The complexity of minimizing and learning OBDDs and FBDDs
- Restricted nondeterministic read-once branching programs and an exponential lower bound for integer multiplication
- Efficient data structures for Boolean functions
- BDDs -- design, analysis, complexity, and applications.
- Lower bounds for restricted read-once parity branching programs
- On the evolution of the worst-case OBDD size
- On the Complexity of the Hidden Weighted Bit Function for Various BDD Models
- Lower bounds for linearly transformed OBDDs and FBDDs
- scientific article; zbMATH DE number 7092118 (Why is no real title available?)
- Boolean expression diagrams
- Formal verification based on Boolean expression diagrams
- Parity OBDDs cannot be handled efficiently enough
- Efficient Boolean manipulation with OBDD's can be extended to FBDD's
- New lower bounds and hierarchy results for restricted branching programs
- AND/OR search spaces for graphical models
This page was built for publication: Graph driven BDDs -- a new data structure for Boolean functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q673788)
