Backdoor DNFs
From MaRDI portal
Publication:6564620
DOI10.1016/J.JCSS.2024.103547MaRDI QIDQ6564620
Sebastian Ordyniak, André Schidler, Stefan Szeider
Publication date: 1 July 2024
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Graph isomorphism parameterized by elimination distance to bounded degree
- Fundamentals of parameterized complexity
- Backdoors into heterogeneous classes of SAT and CSP
- Backdoor sets of quantified Boolean formulas
- Variable and term removal from Boolean formulae
- Which problems have strongly exponential complexity?
- On structural parameterizations of happy coloring, empire coloring and boxicity
- New width parameters for model counting
- Backdoors for linear temporal logic
- Augmenting tractable fragments of abstract argumentation
- Parameterized algorithms for conflict-free colorings of graphs
- Towards fully multivariate algorithmics: parameter ecology and the deconstruction of computational complexity
- The power of linear-time data reduction for maximum matching
- On happy colorings, cuts, and structural parameterizations
- Parameterized algorithms for Graph Burning problem
- Dividing splittable goods evenly and with limited fragmentation
- Backdoors to planning
- Backdoors to tractable answer set programming
- Fixed-parameter tractable distances to sparse graph classes
- FPT algorithms to compute the elimination distance to bipartite graphs and more
- Backdoors to Satisfaction
- MUS Extraction Using Clausal Proofs
- Impact of Community Structure on SAT Solver Performance
- The Fractal Dimension of SAT Formulas
- Community Structure Inspired Algorithms for SAT and #SAT
- Tradeoffs in the Complexity of Backdoor Detection
- Encoding Treewidth into SAT
- Renaming a Set of Clauses as a Horn Set
- Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting
- Backdoor Sets for CSP.
- A Fixed-Parameter Tractable Algorithm for Elimination Distance to Bounded Degree Graphs
- Backdoors to Normality for Disjunctive Logic Programs
- Parameterized and Exact Computation
- The complexity of satisfiability problems
- Parameterized Algorithms
- The complexity of theorem-proving procedures
- Temporal graph classes: a view through temporal separators
- Efficient algorithms for measuring the funnel-likeness of DAGs
- Parameterized aspects of triangle enumeration
- Block elimination distance
- On structural parameterizations of firefighting
- Parameterizing path partitions
- On the Parameterized Complexity of Clique Elimination Distance
- SAT backdoors: depth beats size
- CSP beyond tractable constraint languages
- Tight vector bin packing with few small items via fast exact matching in multigraphs
This page was built for publication: Backdoor DNFs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6564620)
