Typical random 3-SAT formulae and the satisfiability threshold

Details Typical random 3-SAT formulae and the satisfiability threshold Typical random 3-SAT formulae and the satisfiability threshold

2002-11-26

arxiv.org/abs/cs/0211036v1

Computer Science

Discrete Mathematics

Scientific paper

We present a new structural (or syntatic) approach for estimating the
satisfiability threshold of random 3-SAT formulae. We show its efficiency in
obtaining a jump from the previous upper bounds, lowering them to 4.506. The
method combines well with other techniques, and also applies to other problems,
such as the 3-colourability of random graphs.

Affiliated with

Also associated with

No associations

Rating

Typical random 3-SAT formulae and the satisfiability 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 Typical random 3-SAT formulae and the satisfiability threshold, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Typical random 3-SAT formulae and the satisfiability threshold will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-140423