A better algorithm for random k-SAT

Details A better algorithm for random k-SAT A better algorithm for random k-SAT

2009-02-20

arxiv.org/abs/0902.3583v1

Mathematics

Combinatorics

Scientific paper

Let F be a uniformly distributed random k-SAT formula with n variables and m clauses. We present a polynomial time algorithm that finds a satisfying assignment of F with high probability for constraint densities m/n<(1-eps_k)2^k\ln(k)/k, where eps_k->0. Previously no efficient algorithm was known to find solutions with non-vanishing probability beyond m/n=1.817.2^k/k [Frieze and Suen, J. of Algorithms 1996].

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-671395