On Compiling Structured CNFs to OBDDs
From MaRDI portal
Publication:3194709
DOI10.1007/978-3-319-20297-6_6zbMath1378.68027OpenAlexW1802541963MaRDI QIDQ3194709
Friedrich Slivovsky, Simone Bova
Publication date: 20 October 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: http://resolver.obvsg.at/urn:nbn:at:at-ubtuw:3-2794
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 (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Maximum matching in a convex bipartite graph
This page was built for publication: On Compiling Structured CNFs to OBDDs
