Tight Bounds For Random MAX 2-SAT

@inproceedings{Hajiaghayi2006TightBF,
  title={Tight Bounds For Random MAX 2-SAT},
  author={Mohammadtaghi Hajiaghayi and Jeong Han Kim},
  year={2006}
}
For a conjunctive normal form formula F with n variables and m = cn 2-variable clauses (c is called the density), denote by maxF is the maximum number of clauses satisfiable by a single assignment of the variables. For the uniform random formula F with density c = 1 + ε, ε À n−1/3, we prove that maxF is in (1 + ε−Θ(ε3))n with high probability. This improves… CONTINUE READING