Random 3CNF formulas elude the Lovasz theta function

Details Random 3CNF formulas elude the Lovasz theta function Random 3CNF formulas elude the Lovasz theta function

2006-03-22

arxiv.org/abs/cs/0603084v1

Computer Science

Computational Complexity

14 pages

Scientific paper

Let $\phi$ be a 3CNF formula with n variables and m clauses. A simple nonconstructive argument shows that when m is sufficiently large compared to n, most 3CNF formulas are not satisfiable. It is an open question whether there is an efficient refutation algorithm that for most such formulas proves that they are not satisfiable. A possible approach to refute a formula $\phi$ is: first, translate it into a graph $G_{\phi}$ using a generic reduction from 3-SAT to max-IS, then bound the maximum independent set of $G_{\phi}$ using the Lovasz $\vartheta$ function. If the $\vartheta$ function returns a value $< m$, this is a certificate for the unsatisfiability of $\phi$. We show that for random formulas with $m < n^{3/2 -o(1)}$ clauses, the above approach fails, i.e. the $\vartheta$ function is likely to return a value of m.

Affiliated with

Also associated with

No associations

Rating

Random 3CNF formulas elude the Lovasz theta function 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 Random 3CNF formulas elude the Lovasz theta function, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Random 3CNF formulas elude the Lovasz theta function will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-548432