scientific article
From MaRDI portal
Publication:2954991
DOI10.4230/LIPIcs.STACS.2015.143zbMath1355.68112arXiv1405.6043MaRDI QIDQ2954991
Florent Capelli, Johann Brault-Baron, Stefan Mengel
Publication date: 24 January 2017
Full work available at URL: https://arxiv.org/abs/1405.6043
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Hypergraphs (05C65)
Related Items (15)
Solving problems on generalized convex graphs via mim-width ⋮ On Compiling CNFs into Structured Deterministic DNNFs ⋮ On Compiling Structured CNFs to OBDDs ⋮ Sum-of-Products with Default Values: Algorithms and Complexity Results ⋮ Steiner trees for hereditary graph classes: a treewidth perspective ⋮ On compiling structured CNFs to OBDDs ⋮ Lower bounds on the mim-width of some graph classes ⋮ Bounding the mim‐width of hereditary graph classes ⋮ Counting minimal transversals of \(\beta\)-acyclic hypergraphs ⋮ Solving problems on generalized convex graphs via mim-width ⋮ Bounding the Mim-Width of Hereditary Graph Classes. ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Parameterized Compilation Lower Bounds for Restricted CNF-Formulas ⋮ Tractability beyond \(\beta\)-acyclicity for conjunctive queries with negation and SAT
This page was built for publication:
