论文信息 - Inclusion-exclusion for k-CNF formulas

Inclusion-exclusion for k-CNF formulas

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 ⌊log k⌋ + 2. This amount of information is also shown to be necessary.

[1] Leslie G. Valiant,et al. The Complexity of Computing the Permanent , 1979, Theor. Comput. Sci..

[2] Eliezer L. Lozinskii. Counting Propositional Models , 1992, Inf. Process. Lett..

[3] Kazuo Iwama,et al. CNF Satisfiability Test by Counting and Polynomial Average Time , 1989, SIAM J. Comput..

[4] Solomon Eyal Shimony,et al. A Note on Approximate Inclusion-exclusion , 1997, Discret. Appl. Math..

[5] Noam Nisan,et al. Approximate Inclusion-Exclusion , 1990, Comb..

[6] Alex Samorodnitsky,et al. Inclusion-exclusion: Exact and approximate , 1996, Comb..