Results 1 -
2 of
2
MINESWEEPER, #MINESWEEPER
, 2003
"... ”Hence the easiest way to ensure you always win: ..."
(Show Context)
unknown title
"... SUMMARY The number of satisfying assignments of k-CNF formulas is computed using the inclusion-exclusion formula for sets of clauses. Recently, it was shown that the information on the sets of clauses of size ≤⌊log k ⌋ + 2 already uniquely determines the number of satisfying assignments of k-CNF for ..."
Abstract
- Add to MetaCart
(Show Context)
SUMMARY The number of satisfying assignments of k-CNF formulas is computed using the inclusion-exclusion formula for sets of clauses. Recently, it was shown that the information on the sets of clauses of size ≤⌊log k ⌋ + 2 already uniquely determines the number of satisfying assignments of k-CNF formulas [1]. The proof was, however, only existential and no explicit procedure was presented. In this paper, we show that such a procedure exists. key words: k-CNF formulas, satisfying assignments, counting, inclusionexclusion 1.
