IEICE TRANSACTIONS on Information
A Note on Approximating Inclusion-Exclusion for k-CNF Formulas
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
- Publication
- IEICE TRANSACTIONS on Information Vol.E88-D No.1 pp.100-102
- Publication Date
- 2005/01/01
- Publicized
- Online ISSN
- DOI
- 10.1093/ietisy/e88-d.1.100
- Type of Manuscript
- Special Section LETTER (Special Section on Foundations of Computer Science)
- Category
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Akihiro MATSUURA, "A Note on Approximating Inclusion-Exclusion for k-CNF Formulas" in IEICE TRANSACTIONS on Information,
vol. E88-D, no. 1, pp. 100-102, January 2005, doi: 10.1093/ietisy/e88-d.1.100.
Abstract: 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
URL: https://global.ieice.org/en_transactions/information/10.1093/ietisy/e88-d.1.100/_p
Copy
@ARTICLE{e88-d_1_100,
author={Akihiro MATSUURA, },
journal={IEICE TRANSACTIONS on Information},
title={A Note on Approximating Inclusion-Exclusion for k-CNF Formulas},
year={2005},
volume={E88-D},
number={1},
pages={100-102},
abstract={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
keywords={},
doi={10.1093/ietisy/e88-d.1.100},
ISSN={},
month={January},}
Copy
TY - JOUR
TI - A Note on Approximating Inclusion-Exclusion for k-CNF Formulas
T2 - IEICE TRANSACTIONS on Information
SP - 100
EP - 102
AU - Akihiro MATSUURA
PY - 2005
DO - 10.1093/ietisy/e88-d.1.100
JO - IEICE TRANSACTIONS on Information
SN -
VL - E88-D
IS - 1
JA - IEICE TRANSACTIONS on Information
Y1 - January 2005
AB - 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
ER -
English
