Cites work
- A fixed-parameter tractable algorithm for elimination distance to bounded degree graphs
- Augmenting tractable fragments of abstract argumentation
- Backdoor sets for CSP
- Backdoor sets of quantified Boolean formulas
- Backdoors for linear temporal logic
- Backdoors into heterogeneous classes of SAT and CSP
- Backdoors to normality for disjunctive logic programs
- Backdoors to planning
- Backdoors to satisfaction
- Backdoors to tractable answer set programming
- Block elimination distance
- Community structure inspired algorithms for SAT and \#SAT
- CSP beyond tractable constraint languages
- Discovering archipelagos of tractability for constraint satisfaction and counting
- Dividing splittable goods evenly and with limited fragmentation
- Encoding Treewidth into SAT
- Fixed-parameter tractable distances to sparse graph classes
- FPT algorithms to compute the elimination distance to bipartite graphs and more
- Fundamentals of parameterized complexity
- Graph isomorphism parameterized by elimination distance to bounded degree
- scientific article; zbMATH DE number 5604125 (Why is no real title available?)
- Impact of Community Structure on SAT Solver Performance
- Matched formulas and backdoor sets
- Multivariate algorithmics for NP-hard string problems
- MUS Extraction Using Clausal Proofs
- New width parameters for model counting
- On happy colorings, cuts, and structural parameterizations
- On structural parameterizations of happy coloring, empire coloring and boxicity
- On the Parameterized Complexity of Clique Elimination Distance
- Parameterized algorithms
- Parameterized algorithms for conflict-free colorings of graphs
- Parameterized algorithms for Graph Burning problem
- Parameterized and Exact Computation
- Parameterizing path partitions
- Renaming a Set of Clauses as a Horn Set
- SAT backdoors: depth beats size
- The complexity of satisfiability problems
- The complexity of theorem-proving procedures
- The fractal dimension of SAT formulas
- The power of linear-time data reduction for maximum matching
- Tight vector bin packing with few small items via fast exact matching in multigraphs
- Towards fully multivariate algorithmics: parameter ecology and the deconstruction of computational complexity
- Tradeoffs in the Complexity of Backdoor Detection
- Variable and term removal from Boolean formulae
- Which problems have strongly exponential complexity?
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)
