On compiling structured CNFs to OBDDs
From MaRDI portal
Publication:2411046
DOI10.1007/s00224-016-9715-zzbMath1378.68028arXiv1411.5494OpenAlexW2785242690WikidataQ55670637 ScholiaQ55670637MaRDI QIDQ2411046
Simone Bova, Friedrich Slivovsky
Publication date: 20 October 2017
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1411.5494
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Classical propositional logic (03B05) Data structures (68P05)
Related Items (2)
Connecting Width and Structure in Knowledge Compilation (Extended Version) ⋮ On the relation between structured \(d\)-DNNFs and SDDs
Cites Work
- Fundamentals of parameterized complexity
- Boolean function complexity. Advances and frontiers.
- An 0(n log n) algorithm for the convex bipartite matching problem
- Improved algorithms for feedback vertex set problems
- Recent developments on graphs of bounded clique-width
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- A partial k-arboretum of graphs with bounded treewidth
- Chordal bipartite graphs of bounded tree- and clique-width
- Upper bounds to the clique width of graphs
- Parametrized complexity theory.
- No Small Nondeterministic Read-Once Branching Programs for CNFs of Bounded Treewidth
- Expander graphs in pure and applied mathematics
- Interval Graphs: Canonical Representations in Logspace
- Expander graphs and their applications
- Level Schedules for Mixed-Model, Just-in-Time Processes
- Branching Programs and Binary Decision Diagrams
- Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
- Treewidth in Verification: Local vs. Global
- Maximum matching in a convex bipartite graph
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On compiling structured CNFs to OBDDs
