English

On the Structure and the Number of Prime Implicants of 2-CNFs

Discrete Mathematics 2015-10-20 v2 Combinatorics

Abstract

Let m(n,k)m(n, k) be the maximum number of prime implicants that any kk-CNF on n variables can have. We show that 3n/3m(n,2)(1+o(1))3n/33^{n/3} \le m(n,2) \le (1+o(1))3^{n/3}.

Keywords

Cite

@article{arxiv.1408.2662,
  title  = {On the Structure and the Number of Prime Implicants of 2-CNFs},
  author = {Navid Talebanfard},
  journal= {arXiv preprint arXiv:1408.2662},
  year   = {2015}
}