82 citations · 369 across the 63 of their papers we have counts for
3 papers · 1 filter
CNFs and DNFs with Exactly Solutions
L. Sunil Chandran, Rishikesh Gajjala, Kuldeep S. Meel
Model counting is a fundamental problem that consists of determining the number of satisfying assignments for a given Boolean formula. The weighted variant, which computes the weig…
The Hard Problems Are Almost Everywhere For Random CNF-XOR Formulas
Jeffrey M. Dudek, Kuldeep S. Meel, Moshe Y. Vardi
Recent universal-hashing based approaches to sampling and counting crucially depend on the runtime performance of SAT solvers on formulas expressed as the conjunction of both CNF c…
Combining the -CNF and XOR Phase-Transitions
Jeffrey M. Dudek, Kuldeep S. Meel, Moshe Y. Vardi
The runtime performance of modern SAT solvers on random -CNF formulas is deeply connected with the 'phase-transition' phenomenon seen empirically in the satisfiability of random…