Results 1 to 10 of about 905 (38)

On oblivious branching programs with bounded repetition that cannot efficiently compute CNFs of bounded treewidth [PDF]

, 2016
In this paper we study complexity of an extension of ordered binary decision diagrams (OBDDs) called c-OBDDs on CNFs of bounded (primal graph) treewidth.
A Borodin, B Bollig, FM Ablayev, I Razgon, Igor Razgon, J Ellis, K Khadiev, M Krause, N Alon   +8 more
core   +1 more source

On the Error Resilience of Ordered Binary Decision Diagrams [PDF]

, 2014
Ordered Binary Decision Diagrams (OBDDs) are a data structure that is used in an increasing number of fields of Computer Science (e.g., logic synthesis, program verification, data mining, bioinformatics, and data protection) for representing and ...
Bernasconi, Anna, Ciriani, Valentina, Lago, Lorenzo   +2 more
core   +3 more sources

OBDD-Based Representation of Interval Graphs [PDF]

, 2013
A graph $G = (V,E)$ can be described by the characteristic function of the edge set $\chi_E$ which maps a pair of binary encoded nodes to 1 iff the nodes are adjacent. Using \emph{Ordered Binary Decision Diagrams} (OBDDs) to store $\chi_E$ can lead to a (
B. Bollig, B. Bollig, B. Bollig, B. Bollig, B. Bollig, C. Meinel, D. Sawitzki, D. Sawitzki, D. Sawitzki, D. Sieling, D.B. Arnold, G.B. Mertzios, G.D. Hachtel, J.R. Burch, K. Hosaka, K. Meer, P. Woelfel, R. Bloem, R. Gentilini, R. Nunkesser, R.E. Bryant, T. Saitoh, Y.-T. Lai   +22 more
core   +1 more source

On OBDD-Based Algorithms and Proof Systems That Dynamically Change Order of Variables [PDF]

, 2017
In 2004 Atserias, Kolaitis and Vardi proposed OBDD-based propositional proof systems that prove unsatisfiability of a CNF formula by deduction of identically false OBDD from OBDDs representing clauses of the initial formula. All OBDDs in such proofs have
Itsykson, Dmitry, Knop, Alexander, Romashchenko, Andrey, Sokolov, Dmitry   +3 more
core   +2 more sources

SDDs are Exponentially More Succinct than OBDDs

, 2016
Introduced by Darwiche (2011), sentential decision diagrams (SDDs) are essentially as tractable as ordered binary decision diagrams (OBDDs), but tend to be more succinct in practice.
Bova, Simone
core   +1 more source

Compiling CSPs: A Complexity Map of (Non-Deterministic) Multivalued Decision Diagrams [PDF]

, 2014
International audienceConstraint Satisfaction Problems (CSPs) offer a powerful framework for representing a great variety of problems. The difficulty is that most of the requests associated with CSPs are NP-hard.
Alexandre Niveau, Cédric Pralet, Freuder E. C., Hélène Fargier, Jérôme Amilhastre, Kam T.   +5 more
core   +3 more sources

Reordering Method and Hierarchies for Quantum and Classical Ordered Binary Decision Diagrams

, 2017
We consider Quantum OBDD model. It is restricted version of read-once Quantum Branching Programs, with respect to "width" complexity. It is known that maximal complexity gap between deterministic and quantum model is exponential.
Khadiev, Kamil, Khadieva, Aliya
core   +1 more source

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.
Razgon, Igor
core   +2 more sources

Ackermann Encoding, Bisimulations, and OBDDs

, 2003
We propose an alternative way to represent graphs via OBDDs based on the observation that a partition of the graph nodes allows sharing among the employed OBDDs. In the second part of the paper we present a method to compute at the same time the quotient
Piazza, Carla, Policriti, Alberto
core   +2 more sources

Width Hierarchy for k-OBDD of Small Width [PDF]

, 2015
In this paper was explored well known model k-OBDD. There are proven width based hierarchy of classes of boolean functions which computed by k-OBDD. The proof of hierarchy is based on sufficient condition of Boolean function's non representation as k ...
Khadiev, Kamil
core   +2 more sources