On the critical exponents of random k-SAT

Mathematics – Probability

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

11 pages. v2 has revised introduction and updated references

Scientific paper

There has been much recent interest in the satisfiability of random Boolean formulas. A random k-SAT formula is the conjunction of m random clauses, each of which is the disjunction of k literals (a variable or its negation). It is known that when the number of variables n is large, there is a sharp transition from satisfiability to unsatisfiability; in the case of 2-SAT this happens when m/n --> 1, for 3-SAT the critical ratio is thought to be m/n ~ 4.2. The sharpness of this transition is characterized by a critical exponent, sometimes called \nu=\nu_k (the smaller the value of \nu the sharper the transition). Experiments have suggested that \nu_3 = 1.5+-0.1, \nu_4 = 1.25+-0.05, \nu_5=1.1+-0.05, \nu_6 = 1.05+-0.05, and heuristics have suggested that \nu_k --> 1 as k --> infinity. We give here a simple proof that each of these exponents is at least 2 (provided the exponent is well-defined). This result holds for each of the three standard ensembles of random k-SAT formulas: m clauses selected uniformly at random without replacement, m clauses selected uniformly at random with replacement, and each clause selected with probability p independent of the other clauses. We also obtain similar results for q-colorability and the appearance of a q-core in a random graph.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

On the critical exponents of random k-SAT 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 On the critical exponents of random k-SAT, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the critical exponents of random k-SAT will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-480945

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.