Results 51 to 60 of about 239 (84)
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 +1 more source
The I/O-complexity of ordered binary-decision diagram manipulation [PDF]
, 1995 Ordered Binary-Decision Diagrams (OBDD) are the state-of-the-art data structure for boolean function manipulation and there exist several software packages for OBDD manipulation. OBDDs have been successfully used to solve problems in e.g. digital-systems
Lars Arge
core
Using Ordered Binary-Decision Diagrams for Compressing Images and Image Sequences [PDF]
, 1995 The Ordered Binary-Decision Diagram (OBDD) has been used to reduce the amount of space and computation required for verifying digital circuits by removing redundant copies of subfunctions.
Mike Starkey, Randy Bryant, Y Bryant
core
Ordered Binary Decision Diagrams and Their Significance in Computer-Aided Design of VLSI Circuits [PDF]
, 1998 Many problems in computer-aided design of highly integrated circuits (CAD for VLSI) can be transformed to the task of manipulating objects over finite domains. The efficiency of these operations depends substantially on the chosen data structures. In the
Thorsten Theobald, Christoph Meinel
core
On OBDDs for CNFs of bounded treewidth [PDF]
, 2014 In this paper we show that a CNF cannot be compiled into an Ordered Binary Decision Diagram (OBDD) of fixed-parameter size parameterized by the primal graph treewidth of the input CNF.
Igor Razgon, Razgon, Igor
core
Size and Structure of Random Ordered Binary Decision Diagrams (Extended Abstract) [PDF]
, 1998 We investigate the size and structure of ordered binary decision diagrams (OBDDs) for random Boolean functions. Wegener [Weg94] proved that for "most" values of n , the expected OBDD-size of a random Boolean function with n variables equals the
Srivastav, A. +5 more
core
On Compiling Structured CNFs to OBDDs. [PDF]
Theory Comput Syst, 2017 Bova S, Slivovsky F.
europepmc +1 more source
Digital logic testing and verification using ordered binary decision diagrams [PDF]
, 1995 Computer-Aided Design has become a major part of design and testing of digital circuits. Since CAD systems use Boolean expressions extensively for testing and verifying digital circuits, it is necessary to find an efficient data structure algorithms for ...
Randhawa, Preet Singh
core +1 more source
Nanowire systems: technology and design. [PDF]
Philos Trans A Math Phys Eng Sci, 2014 Gaillardon PE +5 more
europepmc +1 more source
Speeding up Variable Reordering of OBDDs [PDF]
, 1997 The use of Ordered Binary Decision Diagrams (OBDDs) as a representation of Boolean functions brought essential progress in many different applications. The optimization of the OBDD-size by the choice of the variable ordering is known to be NP-hard.
Anna Slobodova, Christoph Meinel
core