In this paper, we study the problem of optimizing a linear program whose...
In this paper, we introduce the technique of geometric amortization for
...
In this paper, we study proof systems in the sense of Cook-Reckhow for
p...
We study a new class of aggregation problems, called dependency weighted...
The field of knowledge compilation establishes the tractability of many ...
In this article, we study the problem of enumerating the models of DNF
f...
We prove that one can count in polynomial time the number of minimal
tra...
We generalize many results concerning the tractability of SAT and #SAT o...
We give a non-FPT lower bound on the size of structured decision DNNF an...
Two main techniques have been used so far to solve the #P-hard problem #...
We extend the knowledge about so-called structural restrictions of
#SAT ...
We show that the propositional model counting problem #SAT for CNF- form...