ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
advertisementadvertisement
Information Processing Letters
Volume 87, Issue 2, 31 July 2003, Pages 111-117
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Purchase PDF (120 K)

 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/S0020-0190(03)00259-X    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2003 Elsevier Science B.V. All rights reserved.

Inclusion–exclusion for k-CNF formulas

Kazuyuki AmanoE-mail The Corresponding Author, a, Kazuo IwamaE-mail The Corresponding Author, b, Akira MaruokaE-mail The Corresponding Author, a, Kenshi MatsuoE-mail The Corresponding Author, a and Akihiro MatsuuraCorresponding Author Contact Information, E-mail The Corresponding Author, b

a Graduate School of Information Sciences, Tohoku University, Aoba 05, Sendai 980-8579, Japan b School of Informatics, Kyoto University, Yoshida-honmachi, Sakyo-ku, Kyoto 606-8501, Japan

Received 27 April 2002; 
revised 17 January 2003. 
Communicated by M. Yamashita 
Available online 17 May 2003.

Purchase the full-text article



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 left floorlogkright floor+2. This amount of information is also shown to be necessary.

Author Keywords: Combinatorial problems; SAT; k-CNF formula; Counting; Inclusion–exclusion


 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.