Structure of random r-SAT below the pure literal threshold

Details Structure of random r-SAT below the pure literal threshold Structure of random r-SAT below the pure literal threshold

2010-08-06

arxiv.org/abs/1008.1260v1

Computer Science

Discrete Mathematics

Scientific paper

It is well known that there is a sharp density threshold for a random $r$-SAT formula to be satisfiable, and a similar, smaller, threshold for it to be satisfied by the pure literal rule. Also, above the satisfiability threshold, where a random formula is with high probability (whp) unsatisfiable, the unsatisfiability is whp due to a large "minimal unsatisfiable subformula" (MUF). By contrast, we show that for the (rare) unsatisfiable formulae below the pure literal threshold, the unsatisfiability is whp due to a unique MUF with smallest possible "excess", failing this whp due to a unique MUF with the next larger excess, and so forth. In the same regime, we give a precise asymptotic expansion for the probability that a formula is unsatisfiable, and efficient algorithms for satisfying a formula or proving its unsatisfiability. It remains open what happens between the pure literal threshold and the satisfiability threshold. We prove analogous results for the $k$-core and $k$-colorability thresholds for a random graph, or more generally a random $r$-uniform hypergraph.

Affiliated with

Also associated with

No associations

Rating

Structure of random r-SAT below the pure literal threshold 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 Structure of random r-SAT below the pure literal threshold, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Structure of random r-SAT below the pure literal threshold will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-231704