no code implementations • 1 May 2022 • Nadia Creignou, Arnaud Durand, Heribert Vollmer
We refine the complexity landscape for enumeration problems by introducing very low classes defined by using Boolean circuits as enumerators.
no code implementations • 24 Jan 2014 • Florent Capelli, Arnaud Durand, Stefan Mengel
We show that the propositional model counting problem #SAT for CNF- formulas with hypergraphs that allow a disjoint branches decomposition can be solved in polynomial time.
