Computer Science – Discrete Mathematics
Scientific paper
2010-02-08
Computer Science
Discrete Mathematics
28 pages; presentation improved
Scientific paper
We give a new insight into the upper bounding of the 3-SAT threshold by the first moment method. The best criteria developed so far to select the solutions to be counted discriminate among neighboring solutions on the basis of uniform information about each individual free variable. What we mean by uniform information, is information which does not depend on the solution: e.g. the number of positive/negative occurrences of the considered variable. What is new in our approach is that we use non uniform information about variables. Thus we are able to make a more precise tuning, resulting in a slight improvement on upper bounding the 3-SAT threshold for various models of formulas defined by their distributions.
Boufkhad Yacine
Hugel Thomas
No associations
LandOfFree
Non Uniform Selection of Solutions for Upper Bounding the 3-SAT 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 Non Uniform Selection of Solutions for Upper Bounding the 3-SAT Threshold, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Non Uniform Selection of Solutions for Upper Bounding the 3-SAT Threshold will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-308605