On the Structure and the Number of Prime Implicants of 2-CNFs
Abstract
Let m(n, k) be the maximum number of prime implicants that any k-CNF on n variables can have. We show that 3n/3 m(n,2) (1+o(1))3n/3.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.