2000 character limit reached
Unsatisfiable (k,(4*2^k/k))-CNF formulas
Published 10 Oct 2008 in cs.DM and cs.GT | (0810.1904v1)
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 * (2k/k))-CNF formula which is unsatisfiable.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
