1 citations · 2 across the 3 of their papers we have counts for
3 papers
cs.CC2023
Bounds on BDD-Based Bucket Elimination
Stefan Mengel
We study BDD-based bucket elimination, an approach to satisfiability testing using variable elimination which has seen several practical implementations in the past. We prove that…
cs.LO2021★ 1 cited
A short note on the counting complexity of conjunctive queries
Stefan Mengel
This note closes a minor gap in the literature on the counting complexity of conjunctive queries by showing that queries that are not free-connex do not have a linear time counting…
cs.CC2014★ 1 cited
Understanding model counting for -acyclic CNF-formulas
Johann Brault-Baron, Florent Capelli, Stefan Mengel
We extend the knowledge about so-called structural restrictions of by giving a polynomial time algorithm for -acyclic . In contrast to previous…