Results 31 to 40 of about 3,866,349 (62)
Factored Edge-Valued Binary Decision Diagrams
, 1997 Factored Edge-Valued Binary Decision Diagrams form an extension to Edge-Valued Binary Decision Diagrams. By associating both an additive and a multiplicative weight with the edges, FEVBDDs can be used to represent a wider range of functions concisely. As
Paul Tafertshofer, Massoud Pedram
core +1 more source
Optimal Ordered Binary Decision Diagrams for Tree-like Circuits
, 1996 Many Boolean functions have short representations by OBDDs (ordered binary decision diagrams), if appropriate variable orderings are used. For tree-like circuits which may contain EXOR-gates it is proved that some depth first traversal leads to an ...
Ingo Wegener +2 more
core
Ordered Binary Decision Diagrams, Graph Theory and Computational Geometry
, 1995 Ordered binary decision diagrams (OBDDs in short) have been shown as a powerful paradigm in handling Boolean functions and have been applied to many fields such as VLSI CAD, AI, combinatorics, etc.
Hiroshi Imai +2 more
core +1 more source
Size and Structure of Random Ordered Binary Decision Diagrams
, 1998 We investigate the size and structure of ordered binary decision diagrams (OBDDs) for random Boolean functions. While it was known that for `most' values of n , the expected OBDD size of a random Boolean function with n variables is equal the worst ...
Clemens Gröpl +2 more
core
The I/O-Complexity of Ordered Binary-Decision Diagram Manipulation [PDF]
, 1996 Ordered Binary-Decision Diagrams (OBDD) are the state-of-the artdata structure for boolean function manipulation and there existseveral software packages for OBDD manipulation. OBDDs havebeen successfully used to solve problems in e.g.
Arge, Lars
core
, 2008 Decision diagrams are a natural representation of finite functions. The obvious complexity measures are length and size which correspond to time and space of computations.
Ingo Wegener +3 more
core
⊕-OBDDs -- a BDD Structure for Probabilistic Verification
, 1998 Ordered Binary Decision Diagrams (OBDDs) have already proved usefull in the verification of combinational and sequential circuits. Due to limitaions of the descriptive power of OBDDs several more general models of Binary Decision Diagrams have been ...
Harald Sack, Christoph Meinel
core
Learning ordered binary decision diagrams
We study the learnability of ordered binary decision diagrams (obdds). We give a polynomial-time algorithm using membership and equivalence queries that finds the minimum obdd for the target respecting a given ordering.
Gavaldà Mestre, Ricard +1 more
core
Binary Decision Diagrams and Beyond: Enabling Technologies for Formal Verification
, 1995 Ordered Binary Decision Diagrams (OBDDs) have found widespread use in CAD applications such as formal verification, logic synthesis, and test generation.
Randal E. Bryant
core
, 2007 We prove an exponential lower bound on the size of proofs in the proof system operating with ordered binary decision diagrams introduced by Atserias, Kolaitis and Vardi [2].
Jan Krajicek
core