Unsatisfiable (k,(4*2^k/k))-CNF formulas

Details Unsatisfiable (k,(4*2^k/k))-CNF formulas Unsatisfiable (k,(4*2^k/k))-CNF formulas

2008-10-10

arxiv.org/abs/0810.1904v1

Computer Science

Discrete Mathematics

3 pages, 1 figure

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Unsatisfiable (k,(4*2^k/k))-CNF formulas does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Unsatisfiable (k,(4*2^k/k))-CNF formulas, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Unsatisfiable (k,(4*2^k/k))-CNF formulas will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-527884