Mathematics – Combinatorics
Scientific paper
2003-10-13
Mathematics
Combinatorics
Scientific paper
We prove that a random 3-SAT instance with clause-to-variable density less
than 3.52 is satisfiable with high probability. The proof comes through an
algorithm which selects (and sets) a variable depending on its degree and that
of its complement.
Hajiaghayi MohammadTaghi
Sorkin Gregory B.
No associations
LandOfFree
The Satisfiability Threshold of Random 3-SAT Is at Least 3.52 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 The Satisfiability Threshold of Random 3-SAT Is at Least 3.52, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Satisfiability Threshold of Random 3-SAT Is at Least 3.52 will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-428582