Unsatisfiable (k,(4*2^k/k))-CNF formulas
classification
💻 cs.DM
cs.GT
keywords
formulaeveryunsatisfiablebooleancalledclauseclausesconjuctive
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.