Copyright © 2003 Elsevier Science B.V. All rights reserved.
Inclusion–exclusion for k-CNF formulas
Received 27 April 2002;
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
We show that the number of satisfying assignments of a k-CNF formula is determined uniquely from the numbers of unsatisfying assignments for clause-sets of size up to
logk
+2. This amount of information is also shown to be necessary.
Author Keywords: Combinatorial problems; SAT; k-CNF formula; Counting; Inclusion–exclusion







E-mail Article
Add to my Quick Links

Cited By in Scopus (1)






