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.
Inclusion-Exclusion Formulas from Independent Complexes
β Scribed by Dominique Attali; Herbert Edelsbrunner
- Publisher
- Springer
- Year
- 2006
- Tongue
- English
- Weight
- 396 KB
- Volume
- 37
- Category
- Article
- ISSN
- 0179-5376
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
The n-candidate ballot problem corresponding to the standard Young tableau has been solved recently by Zeilberger (Discrete Math. 44 (1983) 325-326) by using the reflection p "rmciple. In this paper, a refinement of Zeilberger's approach is provided in which the reflection principle is formulated th
## Abstract Following the collapse of the Soviet Union, donor agencies embraced the idea of civil society development as critical to democratisation and successful transition. The belief was that stronger civil societies would promote good governance, increased civic participation and social trust.