2 citations · 3 across the 4 of their papers we have counts for
4 papers
Solving linear programs on factorized databases
Florent Capelli, Nicolas Crosetti, Joachim Niehren +1
A typical workflow for solving a linear programming problem is to first write a linear program parametrized by the data in a language such as Math GNU Prog or AMPL then call the so…
Understanding the complexity of #SAT using knowledge compilation
Florent Capelli
Two main techniques have been used so far to solve the #P-hard problem #SAT. The first one, used in practice, is based on an extension of DPLL for model counting called exhaustive…
A Strongly Exponential Separation of DNNFs from CNF Formulas
Simone Bova, Florent Capelli, Stefan Mengel +1
Decomposable Negation Normal Forms (DNNFs) are Boolean circuits in negation normal form where the subcircuits leading into each AND gate are defined on disjoint sets of variables.…
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…