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

DOI10.1109/12.324545zbMath1063.68573OpenAlexW2138273756MaRDI QIDQ4419787

Christoph Meinel, Jordan Gergov

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)

Related Items

The complexity of minimizing and learning OBDDs and FBDDs, Parity OBDDs cannot be handled efficiently enough, Knowledge compilation meets database theory: compiling queries to decision diagrams, Unnamed Item, Formal verification based on Boolean expression diagrams, BDDs -- design, analysis, complexity, and applications., Restricted Nondeterministic Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication, Minimization problems for parity OBDDs, Boolean expression diagrams, Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication, A very simple function that requires exponential size nondeterministic graph-driven read-once branching programs, On the Tractable Counting of Theory Models and its Application to Truth Maintenance and Belief Revision, Completeness and non-completeness results with respect to read-once projections, Complexity Theoretical Results on Nondeterministic Graph-driven Read-Once Branching Programs, AND/OR search spaces for graphical models, On the relation between BDDs and FDDs, A very simple function that requires exponential size read-once branching programs., On the evolution of the worst-case OBDD size