Unsatisfiable (k,(4*2^k/k))-CNF formulas
Discrete Mathematics
2008-10-13 v1 Computer Science and Game Theory
Abstract
A boolean formula in a conjuctive normal form is called a (k,s)-formula if every clause contains exactly k variables and every variable occurs in at most s clauses. We prove the existence of a (k, 4 * (2^k/k))-CNF formula which is unsatisfiable.
Cite
@article{arxiv.0810.1904,
title = {Unsatisfiable (k,(4*2^k/k))-CNF formulas},
author = {Heidi Gebauer},
journal= {arXiv preprint arXiv:0810.1904},
year = {2008}
}
Comments
3 pages, 1 figure