Efficient Boolean manipulation with OBDD's can be extended to FBDD's

DOI10.1109/12.324545MaRDI QIDQ4419787zbMATH OpenOpenAlexFDO

Authors Jordan Gergov, Christoph Meinel

Publication date 1994

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/12.324545

Mathematics Subject Classification ID

Data structures (68P05) Computer system organization (68M99)

Recommendations

• On the relation between BDDs and FDDs
• On the relation between BDDs and FDDs (extended abstract)
• Graph-Based Algorithms for Boolean Function Manipulation
• Graph driven BDDs -- a new data structure for Boolean functions
• scientific article; zbMATH DE number 1948534

Cited in

(20)

• Completeness and non-completeness results with respect to read-once projections
• 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
• 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
• Application of BDDs in Boolean matching techniques for formal logic combinational verification
• The complexity of minimizing and learning OBDDs and FBDDs
• Restricted nondeterministic read-once branching programs and an exponential lower bound for integer multiplication
• Feature necessity \& relevancy in ML classifier explanations
• BDDs -- design, analysis, complexity, and applications.
• On the evolution of the worst-case OBDD size
• 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
• AND/OR search spaces for graphical models

This page was built for publication: Efficient Boolean manipulation with OBDD's can be extended to FBDD's

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4419787)